/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:18:55,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:18:55,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:18:55,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:18:55,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:18:55,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:18:55,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:18:55,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:18:55,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:18:55,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:18:55,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:18:55,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:18:55,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:18:55,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:18:55,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:18:55,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:18:55,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:18:55,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:18:55,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:18:55,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:18:55,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:18:55,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:18:55,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:18:55,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:18:55,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:18:55,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:18:55,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:18:55,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:18:55,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:18:55,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:18:55,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:18:55,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:18:55,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:18:55,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:18:55,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:18:55,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:18:55,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:18:55,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:18:55,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:18:55,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:18:55,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:18:55,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:18:55,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:18:55,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:18:55,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:18:55,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:18:55,948 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:18:55,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:18:55,949 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:18:55,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:18:55,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:18:55,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:18:55,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:18:55,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:18:55,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:18:55,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:18:55,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:18:55,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:18:55,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:18:55,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:18:55,953 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 01:18:56,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:18:56,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:18:56,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:18:56,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:18:56,271 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:18:56,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-13 01:18:57,259 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:18:57,431 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:18:57,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-13 01:18:57,436 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c0b25f8/58bdf315382848eeb3d6a8ba319a6a93/FLAG1444a987c [2022-12-13 01:18:57,446 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c0b25f8/58bdf315382848eeb3d6a8ba319a6a93 [2022-12-13 01:18:57,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:18:57,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:18:57,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:18:57,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:18:57,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:18:57,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bd7a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57, skipping insertion in model container [2022-12-13 01:18:57,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:18:57,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:18:57,673 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-13 01:18:57,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:18:57,695 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:18:57,730 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-13 01:18:57,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:18:57,748 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:18:57,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57 WrapperNode [2022-12-13 01:18:57,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:18:57,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:18:57,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:18:57,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:18:57,758 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:18:57" (1/1) ... [2022-12-13 01:18:57,778 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:18:57" (1/1) ... [2022-12-13 01:18:57,820 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 281 [2022-12-13 01:18:57,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:18:57,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:18:57,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:18:57,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:18:57,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,866 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:18:57,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:18:57,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:18:57,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:18:57,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (1/1) ... [2022-12-13 01:18:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:18:57,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:18:57,900 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 01:18:57,916 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 01:18:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:18:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:18:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:18:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:18:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:18:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:18:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:18:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:18:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:18:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:18:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:18:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:18:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:18:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:18:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:18:57,945 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 01:18:58,078 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:18:58,079 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:18:58,478 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:18:58,491 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:18:58,492 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 01:18:58,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:18:58 BoogieIcfgContainer [2022-12-13 01:18:58,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:18:58,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:18:58,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:18:58,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:18:58,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:18:57" (1/3) ... [2022-12-13 01:18:58,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dceb99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:18:58, skipping insertion in model container [2022-12-13 01:18:58,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:18:57" (2/3) ... [2022-12-13 01:18:58,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dceb99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:18:58, skipping insertion in model container [2022-12-13 01:18:58,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:18:58" (3/3) ... [2022-12-13 01:18:58,504 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2022-12-13 01:18:58,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:18:58,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:18:58,520 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:18:58,634 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:18:58,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 318 transitions, 660 flow [2022-12-13 01:18:58,832 INFO L130 PetriNetUnfolder]: 29/315 cut-off events. [2022-12-13 01:18:58,833 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:18:58,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 315 events. 29/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 510 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 01:18:58,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 318 transitions, 660 flow [2022-12-13 01:18:58,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 305 transitions, 628 flow [2022-12-13 01:18:58,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:18:58,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-13 01:18:58,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 305 transitions, 628 flow [2022-12-13 01:18:58,963 INFO L130 PetriNetUnfolder]: 29/305 cut-off events. [2022-12-13 01:18:58,964 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:18:58,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 305 events. 29/305 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 509 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 01:18:58,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-13 01:18:58,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-13 01:19:07,816 INFO L241 LiptonReduction]: Total number of compositions: 269 [2022-12-13 01:19:07,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:19:07,834 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;@4b3cff80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:19:07,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:19:07,843 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-13 01:19:07,843 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:19:07,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:07,844 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 01:19:07,844 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 01:19:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -33773561, now seen corresponding path program 1 times [2022-12-13 01:19:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:07,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368992380] [2022-12-13 01:19:07,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:09,098 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 01:19:09,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368992380] [2022-12-13 01:19:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368992380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:09,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:09,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:19:09,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338348707] [2022-12-13 01:19:09,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:19:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:19:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:19:09,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 01:19:09,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 01:19:09,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:09,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 01:19:09,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:09,950 INFO L130 PetriNetUnfolder]: 1997/2838 cut-off events. [2022-12-13 01:19:09,951 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 01:19:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 2838 events. 1997/2838 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11942 event pairs, 166 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 2936. Up to 1149 conditions per place. [2022-12-13 01:19:09,964 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 118 selfloop transitions, 14 changer transitions 4/136 dead transitions. [2022-12-13 01:19:09,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 136 transitions, 607 flow [2022-12-13 01:19:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:19:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:19:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-13 01:19:09,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2022-12-13 01:19:09,978 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 90 flow. Second operand 10 states and 139 transitions. [2022-12-13 01:19:09,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 136 transitions, 607 flow [2022-12-13 01:19:09,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 136 transitions, 565 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:19:09,989 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 171 flow [2022-12-13 01:19:09,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2022-12-13 01:19:09,993 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 01:19:09,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:09,994 INFO L89 Accepts]: Start accepts. Operand has 46 places, 49 transitions, 171 flow [2022-12-13 01:19:09,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:09,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:09,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 49 transitions, 171 flow [2022-12-13 01:19:10,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 49 transitions, 171 flow [2022-12-13 01:19:10,038 INFO L130 PetriNetUnfolder]: 18/89 cut-off events. [2022-12-13 01:19:10,038 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:19:10,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 89 events. 18/89 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 280 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-12-13 01:19:10,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 49 transitions, 171 flow [2022-12-13 01:19:10,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-13 01:19:10,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1161] $Ultimate##0-->L78-2: Formula: (and (= v_~n2~0_42 (+ v_~n3~0_40 v_~res3~0_23)) (= |v_thread3Thread1of1ForFork2_~i~2#1_51| 0)) InVars {~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40} OutVars{~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_51|, ~res3~0=v_~res3~0_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1, ~res3~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-13 01:19:10,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-13 01:19:20,783 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:19:20,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10790 [2022-12-13 01:19:20,784 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 174 flow [2022-12-13 01:19:20,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 01:19:20,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:20,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:19:20,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:19:20,786 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 01:19:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 801774043, now seen corresponding path program 1 times [2022-12-13 01:19:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:20,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121648952] [2022-12-13 01:19:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:21,754 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 01:19:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:21,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121648952] [2022-12-13 01:19:21,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121648952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:21,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:21,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:19:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088991348] [2022-12-13 01:19:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:19:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:19:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:19:21,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:19:21,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 174 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:19:21,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:21,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:19:21,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:22,391 INFO L130 PetriNetUnfolder]: 1981/2852 cut-off events. [2022-12-13 01:19:22,392 INFO L131 PetriNetUnfolder]: For 677/677 co-relation queries the response was YES. [2022-12-13 01:19:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 2852 events. 1981/2852 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12199 event pairs, 424 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 4491. Up to 1149 conditions per place. [2022-12-13 01:19:22,402 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 9 changer transitions 8/117 dead transitions. [2022-12-13 01:19:22,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 117 transitions, 563 flow [2022-12-13 01:19:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:19:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:19:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 01:19:22,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2022-12-13 01:19:22,404 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 174 flow. Second operand 6 states and 118 transitions. [2022-12-13 01:19:22,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 117 transitions, 563 flow [2022-12-13 01:19:22,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 117 transitions, 531 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 01:19:22,410 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 163 flow [2022-12-13 01:19:22,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-13 01:19:22,411 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-13 01:19:22,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:22,411 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 163 flow [2022-12-13 01:19:22,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:22,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:22,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 163 flow [2022-12-13 01:19:22,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 163 flow [2022-12-13 01:19:22,422 INFO L130 PetriNetUnfolder]: 16/78 cut-off events. [2022-12-13 01:19:22,422 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 01:19:22,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 78 events. 16/78 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 235 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. [2022-12-13 01:19:22,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 163 flow [2022-12-13 01:19:22,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 01:19:22,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:19:22,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 01:19:22,425 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 163 flow [2022-12-13 01:19:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:19:22,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:22,426 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 01:19:22,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:19:22,426 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 01:19:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1071655459, now seen corresponding path program 1 times [2022-12-13 01:19:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:22,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242051799] [2022-12-13 01:19:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:22,715 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 01:19:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:22,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242051799] [2022-12-13 01:19:22,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242051799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:22,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:22,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:19:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504513296] [2022-12-13 01:19:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:22,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:19:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:22,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:19:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:19:22,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:19:22,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 163 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:19:22,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:22,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:19:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:23,335 INFO L130 PetriNetUnfolder]: 2960/4239 cut-off events. [2022-12-13 01:19:23,336 INFO L131 PetriNetUnfolder]: For 1985/1985 co-relation queries the response was YES. [2022-12-13 01:19:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10103 conditions, 4239 events. 2960/4239 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19376 event pairs, 1309 based on Foata normal form. 73/3562 useless extension candidates. Maximal degree in co-relation 8575. Up to 2401 conditions per place. [2022-12-13 01:19:23,356 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 108 selfloop transitions, 6 changer transitions 4/118 dead transitions. [2022-12-13 01:19:23,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 118 transitions, 594 flow [2022-12-13 01:19:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:19:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:19:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 01:19:23,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-13 01:19:23,359 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 163 flow. Second operand 5 states and 111 transitions. [2022-12-13 01:19:23,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 118 transitions, 594 flow [2022-12-13 01:19:23,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 118 transitions, 577 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 01:19:23,377 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2022-12-13 01:19:23,378 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 01:19:23,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:23,379 INFO L89 Accepts]: Start accepts. Operand has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:23,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:23,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,394 INFO L130 PetriNetUnfolder]: 24/130 cut-off events. [2022-12-13 01:19:23,394 INFO L131 PetriNetUnfolder]: For 57/58 co-relation queries the response was YES. [2022-12-13 01:19:23,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 130 events. 24/130 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 556 event pairs, 0 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 189. Up to 11 conditions per place. [2022-12-13 01:19:23,395 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-13 01:19:23,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:19:23,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:19:23,398 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 212 flow [2022-12-13 01:19:23,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:19:23,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:23,398 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 01:19:23,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:19:23,398 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 01:19:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash -112413539, now seen corresponding path program 2 times [2022-12-13 01:19:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:23,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000707495] [2022-12-13 01:19:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:23,757 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 01:19:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000707495] [2022-12-13 01:19:23,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000707495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:23,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:23,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:19:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443410676] [2022-12-13 01:19:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:19:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:19:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:19:23,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:19:23,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 212 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:19:23,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:23,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:19:23,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:24,427 INFO L130 PetriNetUnfolder]: 2858/4136 cut-off events. [2022-12-13 01:19:24,427 INFO L131 PetriNetUnfolder]: For 3472/3472 co-relation queries the response was YES. [2022-12-13 01:19:24,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10337 conditions, 4136 events. 2858/4136 cut-off events. For 3472/3472 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18869 event pairs, 1451 based on Foata normal form. 103/3490 useless extension candidates. Maximal degree in co-relation 8837. Up to 2401 conditions per place. [2022-12-13 01:19:24,448 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 105 selfloop transitions, 6 changer transitions 6/117 dead transitions. [2022-12-13 01:19:24,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 608 flow [2022-12-13 01:19:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:19:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:19:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 01:19:24,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-13 01:19:24,451 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 212 flow. Second operand 5 states and 111 transitions. [2022-12-13 01:19:24,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 608 flow [2022-12-13 01:19:24,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 117 transitions, 594 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 01:19:24,489 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 254 flow [2022-12-13 01:19:24,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-13 01:19:24,490 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-13 01:19:24,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:24,491 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 254 flow [2022-12-13 01:19:24,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:24,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:24,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 254 flow [2022-12-13 01:19:24,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 254 flow [2022-12-13 01:19:24,506 INFO L130 PetriNetUnfolder]: 22/127 cut-off events. [2022-12-13 01:19:24,506 INFO L131 PetriNetUnfolder]: For 82/83 co-relation queries the response was YES. [2022-12-13 01:19:24,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 127 events. 22/127 cut-off events. For 82/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 550 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 200. Up to 10 conditions per place. [2022-12-13 01:19:24,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 254 flow [2022-12-13 01:19:24,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-13 01:19:24,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-13 01:19:24,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1161] $Ultimate##0-->L78-2: Formula: (and (= v_~n2~0_42 (+ v_~n3~0_40 v_~res3~0_23)) (= |v_thread3Thread1of1ForFork2_~i~2#1_51| 0)) InVars {~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40} OutVars{~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_51|, ~res3~0=v_~res3~0_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1, ~res3~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-13 01:19:24,641 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:19:24,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:19:24,642 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 266 flow [2022-12-13 01:19:24,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:19:24,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:24,643 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 01:19:24,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:19:24,643 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 01:19:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1384747613, now seen corresponding path program 1 times [2022-12-13 01:19:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494910930] [2022-12-13 01:19:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:24,722 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 01:19:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:24,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494910930] [2022-12-13 01:19:24,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494910930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:24,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:24,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:19:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350318603] [2022-12-13 01:19:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:24,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:19:24,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:19:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:19:24,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:19:24,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 266 flow. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 01:19:24,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:24,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:19:24,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:25,363 INFO L130 PetriNetUnfolder]: 3810/5500 cut-off events. [2022-12-13 01:19:25,363 INFO L131 PetriNetUnfolder]: For 6728/6728 co-relation queries the response was YES. [2022-12-13 01:19:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14562 conditions, 5500 events. 3810/5500 cut-off events. For 6728/6728 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26577 event pairs, 2210 based on Foata normal form. 1/4522 useless extension candidates. Maximal degree in co-relation 13050. Up to 4022 conditions per place. [2022-12-13 01:19:25,390 INFO L137 encePairwiseOnDemand]: 37/41 looper letters, 99 selfloop transitions, 3 changer transitions 7/109 dead transitions. [2022-12-13 01:19:25,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 661 flow [2022-12-13 01:19:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:19:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:19:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 01:19:25,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2022-12-13 01:19:25,392 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 266 flow. Second operand 4 states and 94 transitions. [2022-12-13 01:19:25,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 661 flow [2022-12-13 01:19:25,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 658 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 01:19:25,415 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 243 flow [2022-12-13 01:19:25,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2022-12-13 01:19:25,416 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-13 01:19:25,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:25,416 INFO L89 Accepts]: Start accepts. Operand has 63 places, 53 transitions, 243 flow [2022-12-13 01:19:25,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:25,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:25,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 243 flow [2022-12-13 01:19:25,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 53 transitions, 243 flow [2022-12-13 01:19:25,435 INFO L130 PetriNetUnfolder]: 27/157 cut-off events. [2022-12-13 01:19:25,435 INFO L131 PetriNetUnfolder]: For 113/114 co-relation queries the response was YES. [2022-12-13 01:19:25,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 157 events. 27/157 cut-off events. For 113/114 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 763 event pairs, 0 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 246. Up to 12 conditions per place. [2022-12-13 01:19:25,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 53 transitions, 243 flow [2022-12-13 01:19:25,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 01:19:25,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-13 01:19:25,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-13 01:19:25,637 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:19:25,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-13 01:19:25,639 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 250 flow [2022-12-13 01:19:25,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 01:19:25,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:25,639 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 01:19:25,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:19:25,639 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 01:19:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash 582170171, now seen corresponding path program 1 times [2022-12-13 01:19:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:25,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171317629] [2022-12-13 01:19:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:25,766 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 01:19:25,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171317629] [2022-12-13 01:19:25,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171317629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:25,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:25,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:19:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096817775] [2022-12-13 01:19:25,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:25,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:19:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:19:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:19:25,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:19:25,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 250 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 01:19:25,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:25,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:19:25,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:26,754 INFO L130 PetriNetUnfolder]: 5307/7609 cut-off events. [2022-12-13 01:19:26,754 INFO L131 PetriNetUnfolder]: For 11305/11305 co-relation queries the response was YES. [2022-12-13 01:19:26,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21484 conditions, 7609 events. 5307/7609 cut-off events. For 11305/11305 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 37881 event pairs, 2678 based on Foata normal form. 2/6290 useless extension candidates. Maximal degree in co-relation 19912. Up to 4654 conditions per place. [2022-12-13 01:19:26,795 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 139 selfloop transitions, 9 changer transitions 14/162 dead transitions. [2022-12-13 01:19:26,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 162 transitions, 957 flow [2022-12-13 01:19:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:19:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:19:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-13 01:19:26,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2022-12-13 01:19:26,798 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 250 flow. Second operand 8 states and 145 transitions. [2022-12-13 01:19:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 162 transitions, 957 flow [2022-12-13 01:19:26,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 162 transitions, 926 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:19:26,828 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 260 flow [2022-12-13 01:19:26,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2022-12-13 01:19:26,830 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-13 01:19:26,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:26,831 INFO L89 Accepts]: Start accepts. Operand has 69 places, 55 transitions, 260 flow [2022-12-13 01:19:26,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:26,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:26,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 55 transitions, 260 flow [2022-12-13 01:19:26,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 55 transitions, 260 flow [2022-12-13 01:19:26,851 INFO L130 PetriNetUnfolder]: 31/192 cut-off events. [2022-12-13 01:19:26,852 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 01:19:26,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 192 events. 31/192 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1013 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 313. Up to 15 conditions per place. [2022-12-13 01:19:26,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 55 transitions, 260 flow [2022-12-13 01:19:26,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-13 01:19:26,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-13 01:19:27,811 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:19:27,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-13 01:19:27,812 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 260 flow [2022-12-13 01:19:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 01:19:27,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:27,812 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 01:19:27,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:19:27,813 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 01:19:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash 314961450, now seen corresponding path program 1 times [2022-12-13 01:19:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:27,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259984791] [2022-12-13 01:19:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:27,868 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 01:19:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259984791] [2022-12-13 01:19:27,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259984791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:27,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:27,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:19:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939293267] [2022-12-13 01:19:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:27,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:19:27,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:19:27,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:19:27,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:19:27,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 01:19:27,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:27,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:19:27,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:28,480 INFO L130 PetriNetUnfolder]: 3256/4697 cut-off events. [2022-12-13 01:19:28,481 INFO L131 PetriNetUnfolder]: For 5857/5857 co-relation queries the response was YES. [2022-12-13 01:19:28,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13427 conditions, 4697 events. 3256/4697 cut-off events. For 5857/5857 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21434 event pairs, 1931 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 12909. Up to 3882 conditions per place. [2022-12-13 01:19:28,497 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 41 selfloop transitions, 0 changer transitions 42/83 dead transitions. [2022-12-13 01:19:28,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 487 flow [2022-12-13 01:19:28,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:19:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:19:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 01:19:28,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 01:19:28,499 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 260 flow. Second operand 4 states and 76 transitions. [2022-12-13 01:19:28,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 487 flow [2022-12-13 01:19:28,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 436 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-13 01:19:28,523 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 140 flow [2022-12-13 01:19:28,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2022-12-13 01:19:28,524 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 01:19:28,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:28,524 INFO L89 Accepts]: Start accepts. Operand has 60 places, 41 transitions, 140 flow [2022-12-13 01:19:28,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:28,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:28,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 41 transitions, 140 flow [2022-12-13 01:19:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 140 flow [2022-12-13 01:19:28,535 INFO L130 PetriNetUnfolder]: 16/80 cut-off events. [2022-12-13 01:19:28,535 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 01:19:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 80 events. 16/80 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 240 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 124. Up to 9 conditions per place. [2022-12-13 01:19:28,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 140 flow [2022-12-13 01:19:28,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 01:19:28,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-13 01:19:28,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:19:28,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:19:28,650 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 142 flow [2022-12-13 01:19:28,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 01:19:28,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:28,650 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 01:19:28,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:19:28,651 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 01:19:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2068596558, now seen corresponding path program 1 times [2022-12-13 01:19:28,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:28,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158474322] [2022-12-13 01:19:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:28,753 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 01:19:28,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:28,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158474322] [2022-12-13 01:19:28,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158474322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:19:28,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:19:28,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:19:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971158308] [2022-12-13 01:19:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:19:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:19:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:19:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:19:28,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:19:28,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 142 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:19:28,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:28,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:19:28,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:29,233 INFO L130 PetriNetUnfolder]: 2465/3451 cut-off events. [2022-12-13 01:19:29,233 INFO L131 PetriNetUnfolder]: For 2581/2581 co-relation queries the response was YES. [2022-12-13 01:19:29,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9061 conditions, 3451 events. 2465/3451 cut-off events. For 2581/2581 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14478 event pairs, 1114 based on Foata normal form. 1/2996 useless extension candidates. Maximal degree in co-relation 9041. Up to 1278 conditions per place. [2022-12-13 01:19:29,245 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 56 selfloop transitions, 4 changer transitions 54/114 dead transitions. [2022-12-13 01:19:29,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 114 transitions, 597 flow [2022-12-13 01:19:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:19:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:19:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 01:19:29,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2022-12-13 01:19:29,246 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 142 flow. Second operand 5 states and 107 transitions. [2022-12-13 01:19:29,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 114 transitions, 597 flow [2022-12-13 01:19:29,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 114 transitions, 543 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-13 01:19:29,262 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 131 flow [2022-12-13 01:19:29,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-13 01:19:29,264 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 01:19:29,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:19:29,265 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 131 flow [2022-12-13 01:19:29,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:19:29,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:29,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 131 flow [2022-12-13 01:19:29,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 131 flow [2022-12-13 01:19:29,272 INFO L130 PetriNetUnfolder]: 11/45 cut-off events. [2022-12-13 01:19:29,272 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:19:29,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 45 events. 11/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 70. Up to 6 conditions per place. [2022-12-13 01:19:29,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 131 flow [2022-12-13 01:19:29,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 01:19:29,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-13 01:19:29,388 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 01:19:29,393 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:19:29,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:19:29,394 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 127 flow [2022-12-13 01:19:29,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:19:29,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:19:29,394 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, 1] [2022-12-13 01:19:29,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:19:29,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:19:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:19:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 322696134, now seen corresponding path program 1 times [2022-12-13 01:19:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:19:29,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55322258] [2022-12-13 01:19:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:19:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:19:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:19:29,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55322258] [2022-12-13 01:19:29,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55322258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:19:29,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972166077] [2022-12-13 01:19:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:19:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:19:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:19:29,862 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 01:19:29,865 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 01:19:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:19:30,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:19:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:19:30,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:19:30,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:19:30,618 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 191 treesize of output 171 [2022-12-13 01:19:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:19:30,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972166077] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:19:30,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:19:30,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-13 01:19:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710899866] [2022-12-13 01:19:30,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:19:30,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 01:19:30,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 01:19:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-12-13 01:19:30,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:19:30,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 127 flow. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 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 01:19:30,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:30,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:19:30,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:31,966 INFO L130 PetriNetUnfolder]: 1920/2806 cut-off events. [2022-12-13 01:19:31,966 INFO L131 PetriNetUnfolder]: For 1142/1142 co-relation queries the response was YES. [2022-12-13 01:19:31,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 2806 events. 1920/2806 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12764 event pairs, 100 based on Foata normal form. 90/2599 useless extension candidates. Maximal degree in co-relation 6538. Up to 771 conditions per place. [2022-12-13 01:19:31,972 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 0 selfloop transitions, 0 changer transitions 149/149 dead transitions. [2022-12-13 01:19:31,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 149 transitions, 706 flow [2022-12-13 01:19:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:19:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:19:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2022-12-13 01:19:31,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25675675675675674 [2022-12-13 01:19:31,973 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 127 flow. Second operand 16 states and 152 transitions. [2022-12-13 01:19:31,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 149 transitions, 706 flow [2022-12-13 01:19:31,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 149 transitions, 674 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 01:19:31,976 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2022-12-13 01:19:31,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2022-12-13 01:19:31,977 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 01:19:31,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:19:31,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 0 transitions, 0 flow [2022-12-13 01:19:31,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:19:31,978 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:19:31,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:19:31,978 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 01:19:31,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:19:31,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:19:31,978 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:19:31,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 01:19:31,979 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:19:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 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 01:19:31,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:19:31,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:19:31,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 01:19:31,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 01:19:31,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:19:32,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:19:32,192 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:19:32,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:19:32,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:19:32,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:19:32 BasicIcfg [2022-12-13 01:19:32,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:19:32,198 INFO L158 Benchmark]: Toolchain (without parser) took 34748.44ms. Allocated memory was 188.7MB in the beginning and 1.0GB in the end (delta: 829.4MB). Free memory was 147.8MB in the beginning and 883.2MB in the end (delta: -735.4MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,198 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 188.7MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:19:32,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.63ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 135.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 188.7MB. Free memory was 135.2MB in the beginning and 132.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,199 INFO L158 Benchmark]: Boogie Preprocessor took 50.14ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,199 INFO L158 Benchmark]: RCFGBuilder took 622.66ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 105.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,199 INFO L158 Benchmark]: TraceAbstraction took 33701.46ms. Allocated memory was 188.7MB in the beginning and 1.0GB in the end (delta: 829.4MB). Free memory was 104.8MB in the beginning and 883.2MB in the end (delta: -778.4MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2022-12-13 01:19:32,201 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.43ms. Allocated memory is still 188.7MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.63ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 135.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 188.7MB. Free memory was 135.2MB in the beginning and 132.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.14ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 622.66ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 105.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 33701.46ms. Allocated memory was 188.7MB in the beginning and 1.0GB in the end (delta: 829.4MB). Free memory was 104.8MB in the beginning and 883.2MB in the end (delta: -778.4MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 286 PlacesBefore, 38 PlacesAfterwards, 305 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 117 ConcurrentYvCompositions, 21 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 10015, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10081, independent: 1512, independent conditional: 0, independent unconditional: 1512, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8536, unknown conditional: 0, unknown unconditional: 8536] , Statistics on independence cache: Total cache size (in pairs): 17022, Positive cache size: 16989, Positive conditional cache size: 0, Positive unconditional cache size: 16989, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: 10.7s, 46 PlacesBefore, 43 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 310, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 54, independent unconditional: 256, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 342, independent: 310, independent conditional: 47, independent unconditional: 263, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 47, independent unconditional: 263, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 142, independent: 129, independent conditional: 28, independent unconditional: 101, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 142, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 342, independent: 181, independent conditional: 19, independent unconditional: 162, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 142, unknown conditional: 28, unknown unconditional: 114] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 129, Positive conditional cache size: 28, Positive unconditional cache size: 101, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 16, independent unconditional: 120, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 136, independent conditional: 16, independent unconditional: 120, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 16, independent unconditional: 120, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 129, independent conditional: 16, independent unconditional: 113, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 136, Positive conditional cache size: 28, Positive unconditional cache size: 108, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 136, Positive conditional cache size: 28, Positive unconditional cache size: 108, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 70, independent unconditional: 192, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 262, independent conditional: 63, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 63, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 302, independent: 250, independent conditional: 51, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 162, Positive conditional cache size: 40, Positive unconditional cache size: 122, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 62 PlacesBefore, 62 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 102, independent unconditional: 176, dependent: 42, dependent conditional: 2, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 278, independent conditional: 86, independent unconditional: 192, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 86, independent unconditional: 192, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 252, independent conditional: 72, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 28, unknown conditional: 14, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 206, Positive conditional cache size: 57, Positive unconditional cache size: 149, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 67 PlacesBefore, 66 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 328, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 128, independent unconditional: 200, dependent: 41, dependent conditional: 1, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 328, independent conditional: 103, independent unconditional: 225, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 103, independent unconditional: 225, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 12, independent unconditional: 7, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 369, independent: 309, independent conditional: 91, independent unconditional: 218, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 19, unknown conditional: 12, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 236, Positive conditional cache size: 71, Positive unconditional cache size: 165, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 51, independent unconditional: 138, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 189, independent conditional: 45, independent unconditional: 144, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 45, independent unconditional: 144, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 224, independent: 175, independent conditional: 32, independent unconditional: 143, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 261, Positive conditional cache size: 86, Positive unconditional cache size: 175, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 65, independent unconditional: 94, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 159, independent conditional: 61, independent unconditional: 98, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 61, independent unconditional: 98, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 146, independent conditional: 48, independent unconditional: 98, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 285, Positive conditional cache size: 101, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - 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): 306, Positive cache size: 285, Positive conditional cache size: 101, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 109]: 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, 413 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: 33.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2713 IncrementalHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 0 mSDtfsCounter, 2713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=4, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 2724 SizeOfPredicates, 49 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 0/3 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 01:19:32,242 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...