/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_30-traces-oplus-vs-meet_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:44,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:44,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:44,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:44,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:44,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:44,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:44,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:44,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:44,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:44,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:44,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:44,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:44,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:44,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:44,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:44,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:44,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:44,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:44,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:44,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:44,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:44,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:44,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:44,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:44,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:44,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:44,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:44,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:44,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:44,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:44,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:44,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:44,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:44,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:44,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:44,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:44,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:44,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:44,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:44,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:44,779 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:44,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:44,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:44,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:44,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:44,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:44,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:44,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:44,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:44,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:44,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:44,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:44,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:44,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:44,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:44,797 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:45,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:45,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:45,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:45,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:45,029 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:45,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-05 23:42:45,955 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:46,147 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:46,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-05 23:42:46,157 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d586cc/58f4cd8f770f41f79669a99ab13b3cb4/FLAGb8f1ccada [2022-12-05 23:42:46,504 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d586cc/58f4cd8f770f41f79669a99ab13b3cb4 [2022-12-05 23:42:46,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:46,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:46,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:46,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:46,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:46,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e36d65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46, skipping insertion in model container [2022-12-05 23:42:46,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:46,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:46,629 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_30-traces-oplus-vs-meet_true.i[1097,1110] [2022-12-05 23:42:46,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:46,779 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:46,789 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_30-traces-oplus-vs-meet_true.i[1097,1110] [2022-12-05 23:42:46,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:46,849 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:46,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46 WrapperNode [2022-12-05 23:42:46,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:46,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:46,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:46,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:46,856 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:42:46" (1/1) ... [2022-12-05 23:42:46,879 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:42:46" (1/1) ... [2022-12-05 23:42:46,898 INFO L138 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2022-12-05 23:42:46,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:46,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:46,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:46,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:46,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:46,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:46,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:46,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:46,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (1/1) ... [2022-12-05 23:42:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:46,979 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:42:46,985 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:42:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:42:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:42:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:42:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:47,017 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:42:47,137 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:47,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:47,307 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:47,312 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:47,312 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:47,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:47 BoogieIcfgContainer [2022-12-05 23:42:47,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:47,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:47,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:47,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:47,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:46" (1/3) ... [2022-12-05 23:42:47,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6753c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:47, skipping insertion in model container [2022-12-05 23:42:47,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:46" (2/3) ... [2022-12-05 23:42:47,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6753c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:47, skipping insertion in model container [2022-12-05 23:42:47,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:47" (3/3) ... [2022-12-05 23:42:47,319 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_30-traces-oplus-vs-meet_true.i [2022-12-05 23:42:47,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:47,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:42:47,332 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:47,394 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:42:47,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 76 transitions, 160 flow [2022-12-05 23:42:47,469 INFO L130 PetriNetUnfolder]: 2/75 cut-off events. [2022-12-05 23:42:47,470 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:47,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 2/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-05 23:42:47,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 76 transitions, 160 flow [2022-12-05 23:42:47,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 62 transitions, 127 flow [2022-12-05 23:42:47,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:47,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 127 flow [2022-12-05 23:42:47,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 127 flow [2022-12-05 23:42:47,531 INFO L130 PetriNetUnfolder]: 1/62 cut-off events. [2022-12-05 23:42:47,532 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 1/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-05 23:42:47,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 127 flow [2022-12-05 23:42:47,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 23:42:50,260 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-05 23:42:50,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:50,274 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;@6a26bf14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:50,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 23:42:50,275 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:50,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:50,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:42:50,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 263, now seen corresponding path program 1 times [2022-12-05 23:42:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012850063] [2022-12-05 23:42:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,351 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:42:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012850063] [2022-12-05 23:42:50,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012850063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:42:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840270960] [2022-12-05 23:42:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:50,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 12 [2022-12-05 23:42:50,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 27 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:42:50,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 12 [2022-12-05 23:42:50,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,395 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-05 23:42:50,395 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:50,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 29 events. 8/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 8 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 49. Up to 25 conditions per place. [2022-12-05 23:42:50,396 INFO L137 encePairwiseOnDemand]: 11/12 looper letters, 8 selfloop transitions, 0 changer transitions 0/11 dead transitions. [2022-12-05 23:42:50,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 41 flow [2022-12-05 23:42:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-12-05 23:42:50,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:42:50,404 INFO L175 Difference]: Start difference. First operand has 16 places, 12 transitions, 27 flow. Second operand 2 states and 15 transitions. [2022-12-05 23:42:50,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 41 flow [2022-12-05 23:42:50,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 40 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:50,406 INFO L231 Difference]: Finished difference. Result has 15 places, 11 transitions, 24 flow [2022-12-05 23:42:50,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=24, PETRI_PLACES=15, PETRI_TRANSITIONS=11} [2022-12-05 23:42:50,410 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, -1 predicate places. [2022-12-05 23:42:50,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,410 INFO L89 Accepts]: Start accepts. Operand has 15 places, 11 transitions, 24 flow [2022-12-05 23:42:50,412 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 11 transitions, 24 flow [2022-12-05 23:42:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 24 flow [2022-12-05 23:42:50,415 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-05 23:42:50,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:50,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:50,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 11 transitions, 24 flow [2022-12-05 23:42:50,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-05 23:42:50,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:50,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-05 23:42:50,436 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 11 transitions, 24 flow [2022-12-05 23:42:50,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:42:50,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:42:50,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:50,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 252057940, now seen corresponding path program 1 times [2022-12-05 23:42:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886536063] [2022-12-05 23:42:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,569 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:42:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886536063] [2022-12-05 23:42:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886536063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372349868] [2022-12-05 23:42:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:50,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:50,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 11 [2022-12-05 23:42:50,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 24 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 11 [2022-12-05 23:42:50,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,603 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-05 23:42:50,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:50,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 3 based on Foata normal form. 4/26 useless extension candidates. Maximal degree in co-relation 38. Up to 14 conditions per place. [2022-12-05 23:42:50,603 INFO L137 encePairwiseOnDemand]: 7/11 looper letters, 5 selfloop transitions, 3 changer transitions 2/12 dead transitions. [2022-12-05 23:42:50,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 12 transitions, 44 flow [2022-12-05 23:42:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-05 23:42:50,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-05 23:42:50,604 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 24 flow. Second operand 3 states and 19 transitions. [2022-12-05 23:42:50,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 12 transitions, 44 flow [2022-12-05 23:42:50,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 44 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:50,605 INFO L231 Difference]: Finished difference. Result has 17 places, 9 transitions, 31 flow [2022-12-05 23:42:50,605 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:42:50,606 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, 1 predicate places. [2022-12-05 23:42:50,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,606 INFO L89 Accepts]: Start accepts. Operand has 17 places, 9 transitions, 31 flow [2022-12-05 23:42:50,606 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 9 transitions, 31 flow [2022-12-05 23:42:50,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 9 transitions, 31 flow [2022-12-05 23:42:50,610 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-05 23:42:50,610 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:50,611 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:42:50,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 9 transitions, 31 flow [2022-12-05 23:42:50,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-05 23:42:50,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L688-->L692: Formula: (and (= (store |v_#pthreadsMutex_209| |v_~#B~0.base_105| (store (select |v_#pthreadsMutex_209| |v_~#B~0.base_105|) |v_~#B~0.offset_105| 0)) |v_#pthreadsMutex_207|) (= v_~g~0_67 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_209|, ~#B~0.base=|v_~#B~0.base_105|, ~#B~0.offset=|v_~#B~0.offset_105|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_207|, ~#B~0.base=|v_~#B~0.base_105|, ~g~0=v_~g~0_67, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_33|, ~#B~0.offset=|v_~#B~0.offset_105|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [234] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_214| |v_~#A~0.base_85|))) (let ((.cse1 (store |v_#pthreadsMutex_214| |v_~#A~0.base_85| (store .cse2 |v_~#A~0.offset_85| 1)))) (let ((.cse0 (select .cse1 |v_~#B~0.base_107|))) (and (= |v_t_funThread1of1ForFork0_#in~arg.base_5| v_t_funThread1of1ForFork0_~arg.base_5) (= (select .cse0 |v_~#B~0.offset_107|) 0) (= v_t_funThread1of1ForFork0_~arg.offset_5 |v_t_funThread1of1ForFork0_#in~arg.offset_5|) (= (store .cse1 |v_~#B~0.base_107| (store .cse0 |v_~#B~0.offset_107| 1)) |v_#pthreadsMutex_213|) (= v_~g~0_69 5) (= (select .cse2 |v_~#A~0.offset_85|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#B~0.base=|v_~#B~0.base_107|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_5|, ~#A~0.offset=|v_~#A~0.offset_85|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_5|, ~#A~0.base=|v_~#A~0.base_85|, ~#B~0.offset=|v_~#B~0.offset_107|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, ~#B~0.base=|v_~#B~0.base_107|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_5|, ~#A~0.offset=|v_~#A~0.offset_85|, ~g~0=v_~g~0_69, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_5, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_27|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_31|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_5|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_5, ~#A~0.base=|v_~#A~0.base_85|, ~#B~0.offset=|v_~#B~0.offset_107|} 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:42:50,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [237] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_349| |v_~#B~0.base_145| (store (select |v_#pthreadsMutex_349| |v_~#B~0.base_145|) |v_~#B~0.offset_145| 0)))) (let ((.cse1 (select .cse3 |v_~#A~0.base_125|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_125| (store .cse1 |v_~#A~0.offset_125| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_145|))) (and (= v_~g~0_98 5) (= (select .cse0 |v_~#B~0.offset_145|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_29| v_t_funThread1of1ForFork0_~arg.offset_29) (= (select .cse1 |v_~#A~0.offset_125|) 0) (= v_t_funThread1of1ForFork0_~arg.base_29 |v_t_funThread1of1ForFork0_#in~arg.base_29|) (= (store .cse2 |v_~#B~0.base_145| (store .cse0 |v_~#B~0.offset_145| 1)) |v_#pthreadsMutex_347|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_349|, ~#B~0.base=|v_~#B~0.base_145|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_29|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_29|, ~#A~0.base=|v_~#A~0.base_125|, ~#B~0.offset=|v_~#B~0.offset_145|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_347|, ~#B~0.base=|v_~#B~0.base_145|, ~g~0=v_~g~0_98, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_29|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_29, ~#B~0.offset=|v_~#B~0.offset_145|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_29|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_29, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_51|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_47|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_45|, ~#A~0.base=|v_~#A~0.base_125|} 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 [225] L692-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_184| |v_~#A~0.base_69| (store (select |v_#pthreadsMutex_184| |v_~#A~0.base_69|) |v_~#A~0.offset_69| 0)) |v_#pthreadsMutex_183|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_184|, ~#A~0.offset=|v_~#A~0.offset_69|, ~#A~0.base=|v_~#A~0.base_69|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_183|, ~#A~0.offset=|v_~#A~0.offset_69|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#A~0.base=|v_~#A~0.base_69|, 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:42:50,721 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:42:50,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-05 23:42:50,723 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 8 transitions, 32 flow [2022-12-05 23:42:50,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:42:50,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:50,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash -776061718, now seen corresponding path program 1 times [2022-12-05 23:42:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635757319] [2022-12-05 23:42:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,905 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:42:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635757319] [2022-12-05 23:42:50,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635757319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027420547] [2022-12-05 23:42:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:50,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-05 23:42:50,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 8 transitions, 32 flow. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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:42:50,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-05 23:42:50,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,925 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:42:50,925 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:42:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 9 events. 0/9 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 3/12 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-05 23:42:50,926 INFO L137 encePairwiseOnDemand]: 4/8 looper letters, 3 selfloop transitions, 4 changer transitions 0/7 dead transitions. [2022-12-05 23:42:50,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 7 transitions, 38 flow [2022-12-05 23:42:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-12-05 23:42:50,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-05 23:42:50,927 INFO L175 Difference]: Start difference. First operand has 14 places, 8 transitions, 32 flow. Second operand 4 states and 9 transitions. [2022-12-05 23:42:50,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 7 transitions, 38 flow [2022-12-05 23:42:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 7 transitions, 34 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:50,928 INFO L231 Difference]: Finished difference. Result has 14 places, 7 transitions, 28 flow [2022-12-05 23:42:50,928 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=4, PETRI_FLOW=28, PETRI_PLACES=14, PETRI_TRANSITIONS=7} [2022-12-05 23:42:50,929 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2022-12-05 23:42:50,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,929 INFO L89 Accepts]: Start accepts. Operand has 14 places, 7 transitions, 28 flow [2022-12-05 23:42:50,930 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 7 transitions, 28 flow [2022-12-05 23:42:50,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 7 transitions, 28 flow [2022-12-05 23:42:50,933 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:42:50,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 9 events. 0/9 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:50,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 7 transitions, 28 flow [2022-12-05 23:42:50,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:51,089 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:42:51,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-05 23:42:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 4 transitions, 20 flow [2022-12-05 23:42:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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:42:51,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:51,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:51,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:42:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 8131975, now seen corresponding path program 1 times [2022-12-05 23:42:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:51,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071104806] [2022-12-05 23:42:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:51,261 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:42:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:51,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071104806] [2022-12-05 23:42:51,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071104806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:51,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:51,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136475879] [2022-12-05 23:42:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:51,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:51,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:51,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-05 23:42:51,263 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:42:51,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:51,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-05 23:42:51,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:51,268 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 23:42:51,268 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:51,268 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:42:51,268 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-05 23:42:51,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 3 transitions, 20 flow [2022-12-05 23:42:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-05 23:42:51,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:42:51,269 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:42:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 3 transitions, 20 flow [2022-12-05 23:42:51,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:51,269 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-05 23:42:51,270 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:42:51,270 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, -7 predicate places. [2022-12-05 23:42:51,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:51,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-05 23:42:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,271 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:51,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:51,271 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:42:51,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:51,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:51,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:42:51,272 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,272 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:42:51,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 23:42:51,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-12-05 23:42:51,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 23:42:51,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:51,274 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-12-05 23:42:51,278 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:51,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:51,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:51 BasicIcfg [2022-12-05 23:42:51,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:51,280 INFO L158 Benchmark]: Toolchain (without parser) took 4774.02ms. Allocated memory was 239.1MB in the beginning and 350.2MB in the end (delta: 111.1MB). Free memory was 203.8MB in the beginning and 280.8MB in the end (delta: -76.9MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,281 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 239.1MB. Free memory is still 216.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:51,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.55ms. Allocated memory is still 239.1MB. Free memory was 203.7MB in the beginning and 184.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.54ms. Allocated memory is still 239.1MB. Free memory was 184.3MB in the beginning and 182.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,281 INFO L158 Benchmark]: Boogie Preprocessor took 29.77ms. Allocated memory is still 239.1MB. Free memory was 182.7MB in the beginning and 181.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,281 INFO L158 Benchmark]: RCFGBuilder took 383.95ms. Allocated memory is still 239.1MB. Free memory was 181.1MB in the beginning and 167.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,282 INFO L158 Benchmark]: TraceAbstraction took 3965.24ms. Allocated memory was 239.1MB in the beginning and 350.2MB in the end (delta: 111.1MB). Free memory was 167.0MB in the beginning and 280.8MB in the end (delta: -113.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:51,282 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.08ms. Allocated memory is still 239.1MB. Free memory is still 216.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.55ms. Allocated memory is still 239.1MB. Free memory was 203.7MB in the beginning and 184.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.54ms. Allocated memory is still 239.1MB. Free memory was 184.3MB in the beginning and 182.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.77ms. Allocated memory is still 239.1MB. Free memory was 182.7MB in the beginning and 181.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 383.95ms. Allocated memory is still 239.1MB. Free memory was 181.1MB in the beginning and 167.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3965.24ms. Allocated memory was 239.1MB in the beginning and 350.2MB in the end (delta: 111.1MB). Free memory was 167.0MB in the beginning and 280.8MB in the end (delta: -113.8MB). 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.7s, 65 PlacesBefore, 16 PlacesAfterwards, 62 TransitionsBefore, 12 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 19 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 173, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 173, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 173, unknown conditional: 0, unknown unconditional: 173] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 14 PlacesBefore, 14 PlacesAfterwards, 11 TransitionsBefore, 11 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 15 PlacesBefore, 14 PlacesAfterwards, 9 TransitionsBefore, 8 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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.2s, 14 PlacesBefore, 11 PlacesAfterwards, 7 TransitionsBefore, 4 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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 - 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, 91 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 13, 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.4s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:51,313 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...