/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/goblint-regression/13-privatized_35-traces-ex-2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:58,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:58,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:58,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:58,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:58,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:58,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:58,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:58,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:58,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:58,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:58,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:58,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:58,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:58,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:58,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:58,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:58,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:58,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:58,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:58,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:58,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:58,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:58,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:58,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:58,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:58,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:58,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:58,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:58,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:58,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:58,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:58,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:58,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:58,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:58,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:58,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:58,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:58,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:58,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:58,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:58,902 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-05 23:42:58,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:58,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:58,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:58,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:58,935 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:58,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:58,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:58,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:58,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:58,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:58,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:58,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:58,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:58,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:58,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:58,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:58,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:58,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:58,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:58,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:58,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:58,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:58,939 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-05 23:42:59,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:59,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:59,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:59,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:59,241 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:59,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-12-05 23:43:00,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:43:00,554 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:43:00,554 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-12-05 23:43:00,566 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68d76b40/bcd7d6969f0e45c0958ce84a4d1a7d6d/FLAG0f657fe4b [2022-12-05 23:43:00,584 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68d76b40/bcd7d6969f0e45c0958ce84a4d1a7d6d [2022-12-05 23:43:00,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:43:00,587 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:43:00,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:00,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:43:00,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:43:00,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:00,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2f9e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00, skipping insertion in model container [2022-12-05 23:43:00,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:00,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:43:00,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:43:00,742 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i[1088,1101] [2022-12-05 23:43:00,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:00,859 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:43:00,873 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i[1088,1101] [2022-12-05 23:43:00,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:00,956 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:43:00,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00 WrapperNode [2022-12-05 23:43:00,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:00,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:00,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:43:00,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:43:00,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:00,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,009 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-05 23:43:01,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:01,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:43:01,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:43:01,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:43:01,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:43:01,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:43:01,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:43:01,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:43:01,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (1/1) ... [2022-12-05 23:43:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:43:01,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:43:01,064 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-05 23:43:01,087 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-05 23:43:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:43:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:43:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:43:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:43:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:43:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:43:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:43:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:43:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:43:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:43:01,106 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:43:01,254 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:43:01,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:43:01,416 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:43:01,422 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:43:01,422 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:43:01,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:01 BoogieIcfgContainer [2022-12-05 23:43:01,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:43:01,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:43:01,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:43:01,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:43:01,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:43:00" (1/3) ... [2022-12-05 23:43:01,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50985410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:01, skipping insertion in model container [2022-12-05 23:43:01,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:00" (2/3) ... [2022-12-05 23:43:01,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50985410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:01, skipping insertion in model container [2022-12-05 23:43:01,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:01" (3/3) ... [2022-12-05 23:43:01,431 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_35-traces-ex-2_true.i [2022-12-05 23:43:01,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:43:01,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:43:01,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:43:01,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:43:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 135 flow [2022-12-05 23:43:01,579 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-12-05 23:43:01,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:01,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 1/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-05 23:43:01,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 135 flow [2022-12-05 23:43:01,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:01,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:01,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:01,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:01,640 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-05 23:43:01,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:43:01,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:01,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 23:43:04,521 INFO L203 LiptonReduction]: Total number of compositions: 46 [2022-12-05 23:43:04,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:43:04,539 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;@7b823827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:43:04,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-05 23:43:04,542 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-05 23:43:04,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:04,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:04,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:43:04,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 214284526, now seen corresponding path program 1 times [2022-12-05 23:43:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:04,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520836811] [2022-12-05 23:43:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:04,837 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-05 23:43:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:04,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520836811] [2022-12-05 23:43:04,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520836811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:04,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:04,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:43:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594481672] [2022-12-05 23:43:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:04,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:43:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:43:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:43:04,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 11 [2022-12-05 23:43:04,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 11 transitions, 25 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:43:04,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:04,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 11 [2022-12-05 23:43:04,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:04,908 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-05 23:43:04,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:04,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 72 event pairs, 6 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 54. Up to 21 conditions per place. [2022-12-05 23:43:04,910 INFO L137 encePairwiseOnDemand]: 7/11 looper letters, 7 selfloop transitions, 3 changer transitions 2/13 dead transitions. [2022-12-05 23:43:04,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 13 transitions, 51 flow [2022-12-05 23:43:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:43:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:43:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-05 23:43:04,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-05 23:43:04,920 INFO L175 Difference]: Start difference. First operand has 15 places, 11 transitions, 25 flow. Second operand 3 states and 18 transitions. [2022-12-05 23:43:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 13 transitions, 51 flow [2022-12-05 23:43:04,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 13 transitions, 50 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:43:04,924 INFO L231 Difference]: Finished difference. Result has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:04,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=31, PETRI_PLACES=17, PETRI_TRANSITIONS=9} [2022-12-05 23:43:04,928 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, 2 predicate places. [2022-12-05 23:43:04,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:04,928 INFO L89 Accepts]: Start accepts. Operand has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:04,930 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:04,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:04,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:04,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 9 transitions, 31 flow [2022-12-05 23:43:04,941 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-05 23:43:04,941 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:43:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 11 events. 0/11 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:43:04,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 9 transitions, 31 flow [2022-12-05 23:43:04,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-05 23:43:04,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [195] L688-->L692: Formula: (and (= v_~g~0_61 0) (= (store |v_#pthreadsMutex_239| |v_~#B~0.base_97| (store (select |v_#pthreadsMutex_239| |v_~#B~0.base_97|) |v_~#B~0.offset_97| 0)) |v_#pthreadsMutex_237|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_239|, ~#B~0.base=|v_~#B~0.base_97|, ~#B~0.offset=|v_~#B~0.offset_97|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_237|, ~#B~0.base=|v_~#B~0.base_97|, ~g~0=v_~g~0_61, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_33|, ~#B~0.offset=|v_~#B~0.offset_97|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [177] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_165| |v_~#A~0.base_55|))) (let ((.cse0 (store |v_#pthreadsMutex_165| |v_~#A~0.base_55| (store .cse2 |v_~#A~0.offset_55| 1)))) (let ((.cse1 (select .cse0 |v_~#B~0.base_59|))) (and (= (store .cse0 |v_~#B~0.base_59| (store .cse1 |v_~#B~0.offset_59| 1)) |v_#pthreadsMutex_163|) (= v_~g~0_23 1) (= v_t_funThread1of1ForFork0_~arg.base_19 |v_t_funThread1of1ForFork0_#in~arg.base_19|) (= (select .cse2 |v_~#A~0.offset_55|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_19| v_t_funThread1of1ForFork0_~arg.offset_19) (= 0 (select .cse1 |v_~#B~0.offset_59|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_165|, ~#B~0.base=|v_~#B~0.base_59|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_19|, ~#A~0.offset=|v_~#A~0.offset_55|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_19|, ~#A~0.base=|v_~#A~0.base_55|, ~#B~0.offset=|v_~#B~0.offset_59|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, ~#B~0.base=|v_~#B~0.base_59|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_19|, ~#A~0.offset=|v_~#A~0.offset_55|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_19, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_23|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_19|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_19|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_19, ~#A~0.base=|v_~#A~0.base_55|, ~#B~0.offset=|v_~#B~0.offset_59|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-05 23:43:05,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [197] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_311| |v_~#B~0.base_123| (store (select |v_#pthreadsMutex_311| |v_~#B~0.base_123|) |v_~#B~0.offset_123| 0)))) (let ((.cse2 (select .cse3 |v_~#A~0.base_103|))) (let ((.cse0 (store .cse3 |v_~#A~0.base_103| (store .cse2 |v_~#A~0.offset_103| 1)))) (let ((.cse1 (select .cse0 |v_~#B~0.base_123|))) (and (= (store .cse0 |v_~#B~0.base_123| (store .cse1 |v_~#B~0.offset_123| 1)) |v_#pthreadsMutex_309|) (= v_~g~0_77 1) (= v_t_funThread1of1ForFork0_~arg.base_35 |v_t_funThread1of1ForFork0_#in~arg.base_35|) (= (select .cse1 |v_~#B~0.offset_123|) 0) (= (select .cse2 |v_~#A~0.offset_103|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_35| v_t_funThread1of1ForFork0_~arg.offset_35)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_311|, ~#B~0.base=|v_~#B~0.base_123|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_35|, ~#A~0.offset=|v_~#A~0.offset_103|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_35|, ~#A~0.base=|v_~#A~0.base_103|, ~#B~0.offset=|v_~#B~0.offset_123|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_309|, ~#B~0.base=|v_~#B~0.base_123|, ~g~0=v_~g~0_77, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_35|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_35, ~#B~0.offset=|v_~#B~0.offset_123|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_35|, ~#A~0.offset=|v_~#A~0.offset_103|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_35, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_39|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_35|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_41|, ~#A~0.base=|v_~#A~0.base_103|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [168] L692-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= |v_#pthreadsMutex_79| (store |v_#pthreadsMutex_80| |v_~#A~0.base_31| (store (select |v_#pthreadsMutex_80| |v_~#A~0.base_31|) |v_~#A~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_80|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_79|, ~#A~0.offset=|v_~#A~0.offset_31|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-05 23:43:05,094 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:43:05,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-05 23:43:05,100 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 8 transitions, 32 flow [2022-12-05 23:43:05,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:43:05,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:05,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:43:05,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:43:05,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1947114439, now seen corresponding path program 1 times [2022-12-05 23:43:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:05,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810405375] [2022-12-05 23:43:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:05,210 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-05 23:43:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810405375] [2022-12-05 23:43:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810405375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:05,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:05,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:43:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340963435] [2022-12-05 23:43:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:43:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:43:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:43:05,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-05 23:43:05,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 8 transitions, 32 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-05 23:43:05,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:05,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-05 23:43:05,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:05,258 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-05 23:43:05,258 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:43:05,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 12 events. 2/12 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 2/14 useless extension candidates. Maximal degree in co-relation 25. Up to 5 conditions per place. [2022-12-05 23:43:05,259 INFO L137 encePairwiseOnDemand]: 4/8 looper letters, 5 selfloop transitions, 4 changer transitions 1/10 dead transitions. [2022-12-05 23:43:05,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 50 flow [2022-12-05 23:43:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:43:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:43:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-12-05 23:43:05,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 23:43:05,260 INFO L175 Difference]: Start difference. First operand has 14 places, 8 transitions, 32 flow. Second operand 5 states and 12 transitions. [2022-12-05 23:43:05,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 50 flow [2022-12-05 23:43:05,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 10 transitions, 46 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:43:05,261 INFO L231 Difference]: Finished difference. Result has 15 places, 7 transitions, 28 flow [2022-12-05 23:43:05,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=7} [2022-12-05 23:43:05,261 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, 0 predicate places. [2022-12-05 23:43:05,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:05,262 INFO L89 Accepts]: Start accepts. Operand has 15 places, 7 transitions, 28 flow [2022-12-05 23:43:05,262 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:05,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:05,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 7 transitions, 28 flow [2022-12-05 23:43:05,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 7 transitions, 28 flow [2022-12-05 23:43:05,265 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:43:05,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:05,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 7 events. 0/7 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:43:05,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 7 transitions, 28 flow [2022-12-05 23:43:05,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:43:05,401 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:43:05,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 23:43:05,403 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 4 transitions, 20 flow [2022-12-05 23:43:05,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-05 23:43:05,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:05,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:43:05,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:43:05,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 6913077, now seen corresponding path program 1 times [2022-12-05 23:43:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:05,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262667004] [2022-12-05 23:43:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:05,598 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-05 23:43:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:05,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262667004] [2022-12-05 23:43:05,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262667004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:05,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:05,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:43:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137568316] [2022-12-05 23:43:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:05,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:43:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:43:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:43:05,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-05 23:43:05,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 4 transitions, 20 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:43:05,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:05,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-05 23:43:05,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:05,620 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 23:43:05,621 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:05,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15 conditions, 3 events. 0/3 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/4 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:43:05,621 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-05 23:43:05,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 3 transitions, 20 flow [2022-12-05 23:43:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:43:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:43:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-05 23:43:05,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:43:05,622 INFO L175 Difference]: Start difference. First operand has 11 places, 4 transitions, 20 flow. Second operand 4 states and 4 transitions. [2022-12-05 23:43:05,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 3 transitions, 20 flow [2022-12-05 23:43:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:43:05,622 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-05 23:43:05,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=4, PETRI_DIFFERENCE_MINUEND_FLOW=8, PETRI_DIFFERENCE_MINUEND_PLACES=6, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=9, PETRI_TRANSITIONS=0} [2022-12-05 23:43:05,624 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, -6 predicate places. [2022-12-05 23:43:05,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:05,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-05 23:43:05,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:05,625 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:43:05,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:05,625 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-05 23:43:05,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:05,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:43:05,625 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:43:05,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:43:05,626 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:05,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:43:05,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-05 23:43:05,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-05 23:43:05,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:43:05,629 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-05 23:43:05,633 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:43:05,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:43:05,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:43:05 BasicIcfg [2022-12-05 23:43:05,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:43:05,640 INFO L158 Benchmark]: Toolchain (without parser) took 5052.87ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 170.4MB in the beginning and 190.3MB in the end (delta: -19.9MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2022-12-05 23:43:05,640 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:43:05,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.43ms. Allocated memory is still 195.0MB. Free memory was 170.1MB in the beginning and 151.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:43:05,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.93ms. Allocated memory is still 195.0MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:43:05,641 INFO L158 Benchmark]: Boogie Preprocessor took 18.32ms. Allocated memory is still 195.0MB. Free memory was 149.1MB in the beginning and 148.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:43:05,641 INFO L158 Benchmark]: RCFGBuilder took 395.60ms. Allocated memory is still 195.0MB. Free memory was 148.1MB in the beginning and 134.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 23:43:05,641 INFO L158 Benchmark]: TraceAbstraction took 4213.43ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 134.4MB in the beginning and 190.3MB in the end (delta: -55.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:43:05,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.43ms. Allocated memory is still 195.0MB. Free memory was 170.1MB in the beginning and 151.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.93ms. Allocated memory is still 195.0MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.32ms. Allocated memory is still 195.0MB. Free memory was 149.1MB in the beginning and 148.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 395.60ms. Allocated memory is still 195.0MB. Free memory was 148.1MB in the beginning and 134.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4213.43ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 134.4MB in the beginning and 190.3MB in the end (delta: -55.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 58 PlacesBefore, 15 PlacesAfterwards, 54 TransitionsBefore, 11 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 46 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 185, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 185, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 185, unknown conditional: 0, unknown unconditional: 185] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 261, Positive conditional cache size: 0, Positive unconditional cache size: 261, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 15 PlacesBefore, 14 PlacesAfterwards, 9 TransitionsBefore, 8 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 14 PlacesBefore, 11 PlacesAfterwards, 7 TransitionsBefore, 4 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 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): 12, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: 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 3 procedures, 81 locations, 2 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: 4.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=1, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-05 23:43:05,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...