/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_25-struct_nr_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:14:54,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:14:54,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:14:54,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:14:54,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:14:54,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:14:54,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:14:54,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:14:54,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:14:54,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:14:54,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:14:54,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:14:54,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:14:54,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:14:54,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:14:54,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:14:54,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:14:54,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:14:54,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:14:54,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:14:54,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:14:54,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:14:54,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:14:54,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:14:54,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:14:54,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:14:54,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:14:54,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:14:54,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:14:54,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:14:54,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:14:54,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:14:54,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:14:54,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:14:54,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:14:54,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:14:54,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:14:54,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:14:54,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:14:54,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:14:54,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:14:54,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:14:54,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:14:54,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:14:54,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:14:54,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:14:54,949 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:14:54,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:14:54,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:14:54,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:14:54,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:14:54,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:14:54,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:14:54,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:14:54,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:14:54,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:14:55,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:14:55,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:14:55,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:14:55,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:14:55,252 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:14:55,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2022-12-13 01:14:56,292 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:14:56,509 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:14:56,509 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2022-12-13 01:14:56,525 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9314b5a/bac2ac8d27e7457fa58e5c46ff1789d3/FLAGf46f0f544 [2022-12-13 01:14:56,541 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9314b5a/bac2ac8d27e7457fa58e5c46ff1789d3 [2022-12-13 01:14:56,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:14:56,545 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:14:56,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:14:56,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:14:56,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:14:56,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56, skipping insertion in model container [2022-12-13 01:14:56,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:14:56,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:14:56,722 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_25-struct_nr_true.i[1086,1099] [2022-12-13 01:14:56,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:14:56,865 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:14:56,875 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_25-struct_nr_true.i[1086,1099] [2022-12-13 01:14:56,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:14:56,933 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:14:56,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56 WrapperNode [2022-12-13 01:14:56,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:14:56,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:14:56,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:14:56,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:14:56,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,980 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2022-12-13 01:14:56,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:14:56,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:14:56,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:14:56,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:14:56,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:56,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,010 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:14:57,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:14:57,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:14:57,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:14:57,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (1/1) ... [2022-12-13 01:14:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:14:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:14:57,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:14:57,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:14:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:14:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:14:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 01:14:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:14:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:14:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 01:14:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 01:14:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:14:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:14:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:14:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:14:57,066 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:14:57,161 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:14:57,162 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:14:57,288 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:14:57,292 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:14:57,292 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:14:57,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:57 BoogieIcfgContainer [2022-12-13 01:14:57,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:14:57,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:14:57,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:14:57,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:14:57,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:14:56" (1/3) ... [2022-12-13 01:14:57,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a3423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:57, skipping insertion in model container [2022-12-13 01:14:57,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:56" (2/3) ... [2022-12-13 01:14:57,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a3423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:57, skipping insertion in model container [2022-12-13 01:14:57,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:57" (3/3) ... [2022-12-13 01:14:57,299 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2022-12-13 01:14:57,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:14:57,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 01:14:57,314 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:14:57,369 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 01:14:57,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 84 transitions, 176 flow [2022-12-13 01:14:57,447 INFO L130 PetriNetUnfolder]: 4/83 cut-off events. [2022-12-13 01:14:57,447 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:14:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 4/83 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-13 01:14:57,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 84 transitions, 176 flow [2022-12-13 01:14:57,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 76 transitions, 155 flow [2022-12-13 01:14:57,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:57,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 76 transitions, 155 flow [2022-12-13 01:14:57,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 76 transitions, 155 flow [2022-12-13 01:14:57,496 INFO L130 PetriNetUnfolder]: 4/76 cut-off events. [2022-12-13 01:14:57,496 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 4/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-13 01:14:57,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 76 transitions, 155 flow [2022-12-13 01:14:57,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-13 01:14:59,789 INFO L241 LiptonReduction]: Total number of compositions: 65 [2022-12-13 01:14:59,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:14:59,805 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;@275bffca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:14:59,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 01:14:59,806 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:14:59,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:59,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:59,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 01:14:59,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:14:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 348, now seen corresponding path program 1 times [2022-12-13 01:14:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541655285] [2022-12-13 01:14:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:14:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:59,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541655285] [2022-12-13 01:14:59,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541655285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:59,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:59,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 01:14:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815360047] [2022-12-13 01:14:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:59,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 01:14:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 01:14:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 01:14:59,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2022-12-13 01:14:59,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 105 flow. Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:59,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:59,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2022-12-13 01:14:59,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:59,985 INFO L130 PetriNetUnfolder]: 221/531 cut-off events. [2022-12-13 01:14:59,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:59,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 531 events. 221/531 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3188 event pairs, 221 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 1001. Up to 475 conditions per place. [2022-12-13 01:14:59,988 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2022-12-13 01:14:59,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 151 flow [2022-12-13 01:14:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 01:14:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 01:14:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2022-12-13 01:14:59,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2022-12-13 01:14:59,997 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 105 flow. Second operand 2 states and 61 transitions. [2022-12-13 01:14:59,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 151 flow [2022-12-13 01:14:59,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:15:00,000 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 86 flow [2022-12-13 01:15:00,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 01:15:00,004 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2022-12-13 01:15:00,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:15:00,005 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 86 flow [2022-12-13 01:15:00,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:15:00,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:00,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 86 flow [2022-12-13 01:15:00,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 86 flow [2022-12-13 01:15:00,011 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-13 01:15:00,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:15:00,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 144 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 01:15:00,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 42 transitions, 86 flow [2022-12-13 01:15:00,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 01:15:00,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:15:00,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:15:00,122 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 84 flow [2022-12-13 01:15:00,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:15:00,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 01:15:00,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:15:00,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:15:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:15:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash 10702782, now seen corresponding path program 1 times [2022-12-13 01:15:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:15:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965666467] [2022-12-13 01:15:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:15:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:15:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:15:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:15:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:15:00,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965666467] [2022-12-13 01:15:00,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965666467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:15:00,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:15:00,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:15:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325949016] [2022-12-13 01:15:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:15:00,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:15:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:15:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:15:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:15:00,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-13 01:15:00,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:15:00,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-13 01:15:00,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:15:00,425 INFO L130 PetriNetUnfolder]: 338/722 cut-off events. [2022-12-13 01:15:00,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:15:00,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 722 events. 338/722 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3920 event pairs, 164 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 1438. Up to 622 conditions per place. [2022-12-13 01:15:00,428 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 57 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2022-12-13 01:15:00,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 262 flow [2022-12-13 01:15:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:15:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:15:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 01:15:00,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2022-12-13 01:15:00,430 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 84 flow. Second operand 3 states and 73 transitions. [2022-12-13 01:15:00,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 262 flow [2022-12-13 01:15:00,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 01:15:00,432 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-12-13 01:15:00,433 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2022-12-13 01:15:00,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:15:00,433 INFO L89 Accepts]: Start accepts. Operand has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:15:00,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:00,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,440 INFO L130 PetriNetUnfolder]: 18/126 cut-off events. [2022-12-13 01:15:00,440 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:15:00,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 126 events. 18/126 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 724 event pairs, 9 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 191. Up to 45 conditions per place. [2022-12-13 01:15:00,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 01:15:00,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:15:00,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 01:15:00,443 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 142 flow [2022-12-13 01:15:00,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:15:00,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 01:15:00,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:15:00,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:15:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:15:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1695153918, now seen corresponding path program 1 times [2022-12-13 01:15:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:15:00,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645763235] [2022-12-13 01:15:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:15:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:15:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:15:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:15:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:15:00,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645763235] [2022-12-13 01:15:00,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645763235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:15:00,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:15:00,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:15:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479183063] [2022-12-13 01:15:00,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:15:00,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:15:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:15:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:15:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:15:00,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-13 01:15:00,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:15:00,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-13 01:15:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:15:00,744 INFO L130 PetriNetUnfolder]: 375/818 cut-off events. [2022-12-13 01:15:00,745 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 01:15:00,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 818 events. 375/818 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4848 event pairs, 106 based on Foata normal form. 7/377 useless extension candidates. Maximal degree in co-relation 1863. Up to 447 conditions per place. [2022-12-13 01:15:00,747 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 52 selfloop transitions, 15 changer transitions 53/121 dead transitions. [2022-12-13 01:15:00,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 121 transitions, 548 flow [2022-12-13 01:15:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:15:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:15:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-12-13 01:15:00,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4843205574912892 [2022-12-13 01:15:00,749 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 142 flow. Second operand 7 states and 139 transitions. [2022-12-13 01:15:00,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 121 transitions, 548 flow [2022-12-13 01:15:00,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 121 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:15:00,752 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 220 flow [2022-12-13 01:15:00,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 01:15:00,752 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2022-12-13 01:15:00,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:15:00,753 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 220 flow [2022-12-13 01:15:00,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:15:00,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:00,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 220 flow [2022-12-13 01:15:00,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 220 flow [2022-12-13 01:15:00,760 INFO L130 PetriNetUnfolder]: 27/154 cut-off events. [2022-12-13 01:15:00,760 INFO L131 PetriNetUnfolder]: For 75/77 co-relation queries the response was YES. [2022-12-13 01:15:00,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 154 events. 27/154 cut-off events. For 75/77 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 941 event pairs, 11 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 336. Up to 54 conditions per place. [2022-12-13 01:15:00,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 220 flow [2022-12-13 01:15:00,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 01:15:00,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [139] L702-1-->L702-2: Formula: (= v_~glob1~0_4 (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[~glob1~0] and [200] L19-5-->L692: Formula: (= (+ v_~glob1~0_9 10) 0) InVars {} OutVars{~glob1~0=v_~glob1~0_9} AuxVars[] AssignedVars[~glob1~0] [2022-12-13 01:15:00,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [130] L702-->L702-1: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| v_~glob1~0_3) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] and [200] L19-5-->L692: Formula: (= (+ v_~glob1~0_9 10) 0) InVars {} OutVars{~glob1~0=v_~glob1~0_9} AuxVars[] AssignedVars[~glob1~0] [2022-12-13 01:15:00,807 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:15:00,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 01:15:00,808 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 224 flow [2022-12-13 01:15:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:15:00,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 01:15:00,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:15:00,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:15:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:15:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1695442519, now seen corresponding path program 1 times [2022-12-13 01:15:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:15:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529626611] [2022-12-13 01:15:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:15:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:15:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:15:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:15:00,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:15:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529626611] [2022-12-13 01:15:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529626611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:15:00,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:15:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:15:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343373555] [2022-12-13 01:15:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:15:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:15:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:15:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:15:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:15:00,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 01:15:00,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:00,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:15:00,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 01:15:00,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:15:00,933 INFO L130 PetriNetUnfolder]: 305/673 cut-off events. [2022-12-13 01:15:00,934 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES. [2022-12-13 01:15:00,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 673 events. 305/673 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4090 event pairs, 110 based on Foata normal form. 5/385 useless extension candidates. Maximal degree in co-relation 1891. Up to 505 conditions per place. [2022-12-13 01:15:00,936 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 41 selfloop transitions, 11 changer transitions 16/68 dead transitions. [2022-12-13 01:15:00,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 438 flow [2022-12-13 01:15:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:15:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:15:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 01:15:00,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-13 01:15:00,937 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 224 flow. Second operand 3 states and 62 transitions. [2022-12-13 01:15:00,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 438 flow [2022-12-13 01:15:00,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 414 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 01:15:00,941 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 260 flow [2022-12-13 01:15:00,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2022-12-13 01:15:00,941 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2022-12-13 01:15:00,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:15:00,942 INFO L89 Accepts]: Start accepts. Operand has 51 places, 44 transitions, 260 flow [2022-12-13 01:15:00,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:15:00,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:00,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 260 flow [2022-12-13 01:15:00,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 260 flow [2022-12-13 01:15:00,949 INFO L130 PetriNetUnfolder]: 32/163 cut-off events. [2022-12-13 01:15:00,949 INFO L131 PetriNetUnfolder]: For 194/202 co-relation queries the response was YES. [2022-12-13 01:15:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 163 events. 32/163 cut-off events. For 194/202 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1041 event pairs, 7 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 440. Up to 63 conditions per place. [2022-12-13 01:15:00,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 260 flow [2022-12-13 01:15:00,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 01:15:00,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L688-1-->L19-5: Formula: (and (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_73| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_51| (ite (= |v_t_funThread1of1ForFork0_~t~0#1_39| 5) 1 0)) (= |v_t_funThread1of1ForFork0_~t~0#1_39| v_~glob1~0_101) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_51| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_73|)) InVars {~glob1~0=v_~glob1~0_101} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_51|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_19|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_39|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_73|, ~glob1~0=v_~glob1~0_101} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] and [336] L702-->L692: Formula: (and (= |v_ULTIMATE.start_main_#t~post5#1_249| v_~glob1~0_711) (= (+ 10 v_~glob1~0_710) 0)) InVars {~glob1~0=v_~glob1~0_711} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_249|, ~glob1~0=v_~glob1~0_710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1, ~glob1~0] [2022-12-13 01:15:01,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:15:01,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 01:15:01,005 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 260 flow [2022-12-13 01:15:01,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:01,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:15:01,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 01:15:01,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:15:01,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:15:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:15:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1695324645, now seen corresponding path program 1 times [2022-12-13 01:15:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:15:01,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179227748] [2022-12-13 01:15:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:15:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:15:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:15:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:15:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:15:01,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179227748] [2022-12-13 01:15:01,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179227748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:15:01,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:15:01,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:15:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221254555] [2022-12-13 01:15:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:15:01,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:15:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:15:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:15:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:15:01,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 01:15:01,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:01,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:15:01,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 01:15:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:15:01,087 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-12-13 01:15:01,087 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:15:01,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 55 events. 0/55 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 178 event pairs, 0 based on Foata normal form. 14/59 useless extension candidates. Maximal degree in co-relation 0. Up to 36 conditions per place. [2022-12-13 01:15:01,088 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 11 selfloop transitions, 6 changer transitions 12/31 dead transitions. [2022-12-13 01:15:01,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 199 flow [2022-12-13 01:15:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:15:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:15:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 01:15:01,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 01:15:01,088 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 260 flow. Second operand 3 states and 44 transitions. [2022-12-13 01:15:01,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 199 flow [2022-12-13 01:15:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 159 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 01:15:01,090 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 77 flow [2022-12-13 01:15:01,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2022-12-13 01:15:01,090 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 01:15:01,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:15:01,090 INFO L89 Accepts]: Start accepts. Operand has 39 places, 19 transitions, 77 flow [2022-12-13 01:15:01,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:15:01,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:01,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 19 transitions, 77 flow [2022-12-13 01:15:01,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 77 flow [2022-12-13 01:15:01,094 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 01:15:01,094 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:15:01,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 31 events. 0/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-13 01:15:01,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 77 flow [2022-12-13 01:15:01,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:15:01,724 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 01:15:01,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 635 [2022-12-13 01:15:01,725 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 9 transitions, 74 flow [2022-12-13 01:15:01,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:15:01,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:15:01,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 01:15:01,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:15:01,726 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:15:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:15:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash 10704396, now seen corresponding path program 1 times [2022-12-13 01:15:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:15:01,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223139527] [2022-12-13 01:15:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:15:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:15:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:15:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:15:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:15:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223139527] [2022-12-13 01:15:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223139527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:15:01,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:15:01,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:15:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143909434] [2022-12-13 01:15:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:15:01,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:15:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:15:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:15:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:15:01,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-13 01:15:01,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 9 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-13 01:15:01,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:15:01,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-13 01:15:01,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:15:01,788 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 01:15:01,788 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 01:15:01,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 7 events. 0/7 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 10 event pairs, 0 based on Foata normal form. 4/9 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-13 01:15:01,788 INFO L137 encePairwiseOnDemand]: 5/9 looper letters, 0 selfloop transitions, 0 changer transitions 7/7 dead transitions. [2022-12-13 01:15:01,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 7 transitions, 74 flow [2022-12-13 01:15:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:15:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:15:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-12-13 01:15:01,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:15:01,789 INFO L175 Difference]: Start difference. First operand has 21 places, 9 transitions, 74 flow. Second operand 3 states and 9 transitions. [2022-12-13 01:15:01,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 7 transitions, 74 flow [2022-12-13 01:15:01,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 7 transitions, 38 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 01:15:01,790 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2022-12-13 01:15:01,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2022-12-13 01:15:01,790 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -37 predicate places. [2022-12-13 01:15:01,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:15:01,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 0 transitions, 0 flow [2022-12-13 01:15:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:15:01,791 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:15:01,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:15:01,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:15:01,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:15:01,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:15:01,791 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:15:01,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 01:15:01,792 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:15:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-13 01:15:01,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 01:15:01,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 01:15:01,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 01:15:01,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-12-13 01:15:01,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-13 01:15:01,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-13 01:15:01,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 01:15:01,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:15:01,795 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 01:15:01,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:15:01,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:15:01,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:15:01 BasicIcfg [2022-12-13 01:15:01,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:15:01,820 INFO L158 Benchmark]: Toolchain (without parser) took 5275.49ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 149.3MB in the beginning and 210.3MB in the end (delta: -61.0MB). Peak memory consumption was 124.4MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,821 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:15:01,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.69ms. Allocated memory is still 185.6MB. Free memory was 149.1MB in the beginning and 130.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.30ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,821 INFO L158 Benchmark]: Boogie Preprocessor took 30.84ms. Allocated memory is still 185.6MB. Free memory was 128.1MB in the beginning and 126.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,821 INFO L158 Benchmark]: RCFGBuilder took 281.12ms. Allocated memory is still 185.6MB. Free memory was 126.6MB in the beginning and 112.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,822 INFO L158 Benchmark]: TraceAbstraction took 4524.74ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 111.4MB in the beginning and 210.3MB in the end (delta: -98.9MB). Peak memory consumption was 86.7MB. Max. memory is 8.0GB. [2022-12-13 01:15:01,822 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 185.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.69ms. Allocated memory is still 185.6MB. Free memory was 149.1MB in the beginning and 130.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.30ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.84ms. Allocated memory is still 185.6MB. Free memory was 128.1MB in the beginning and 126.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.12ms. Allocated memory is still 185.6MB. Free memory was 126.6MB in the beginning and 112.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4524.74ms. Allocated memory was 185.6MB in the beginning and 235.9MB in the end (delta: 50.3MB). Free memory was 111.4MB in the beginning and 210.3MB in the end (delta: -98.9MB). Peak memory consumption was 86.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 76 PlacesBefore, 52 PlacesAfterwards, 76 TransitionsBefore, 51 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 26 ConcurrentYvCompositions, 3 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2608, independent: 2410, independent conditional: 2410, independent unconditional: 0, dependent: 198, dependent conditional: 198, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2608, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2608, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2608, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1397, independent: 1354, independent conditional: 0, independent unconditional: 1354, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1397, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 164, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2608, independent: 1056, independent conditional: 0, independent unconditional: 1056, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 1397, unknown conditional: 0, unknown unconditional: 1397] , Statistics on independence cache: Total cache size (in pairs): 2975, Positive cache size: 2932, Positive conditional cache size: 0, Positive unconditional cache size: 2932, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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, 45 PlacesBefore, 44 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 428, independent: 302, independent conditional: 302, independent unconditional: 0, dependent: 126, dependent conditional: 126, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 428, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 428, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 428, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 161, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 161, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 428, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 161, unknown conditional: 0, unknown unconditional: 161] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 199, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 199, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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, 49 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249, independent: 217, independent conditional: 217, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 249, independent: 217, independent conditional: 25, independent unconditional: 192, dependent: 32, dependent conditional: 18, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249, independent: 217, independent conditional: 13, independent unconditional: 204, dependent: 32, dependent conditional: 18, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249, independent: 217, independent conditional: 13, independent unconditional: 204, dependent: 32, dependent conditional: 18, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 4, independent unconditional: 11, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, independent: 202, independent conditional: 9, independent unconditional: 193, dependent: 27, dependent conditional: 13, dependent unconditional: 14, unknown: 20, unknown conditional: 9, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 182, Positive conditional cache size: 4, Positive unconditional cache size: 178, Negative cache size: 43, Negative conditional cache size: 5, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 34, dependent conditional: 22, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 34, dependent conditional: 22, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 34, dependent conditional: 22, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 33, dependent conditional: 21, dependent unconditional: 12, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 183, Positive conditional cache size: 4, Positive unconditional cache size: 179, Negative cache size: 44, Negative conditional cache size: 6, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 30 PlacesBefore, 21 PlacesAfterwards, 19 TransitionsBefore, 9 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 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): 254, Positive cache size: 210, Positive conditional cache size: 4, Positive unconditional cache size: 206, Negative cache size: 44, Negative conditional cache size: 6, Negative unconditional cache size: 38, 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): 254, Positive cache size: 210, Positive conditional cache size: 4, Positive unconditional cache size: 206, Negative cache size: 44, Negative conditional cache size: 6, Negative unconditional cache size: 38, 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 - 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, 107 locations, 7 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.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 17 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=4, InterpolantAutomatonStates: 21, 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, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 01:15:01,846 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...