/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:41:23,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:41:23,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:41:23,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:41:23,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:41:23,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:41:23,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:41:23,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:41:23,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:41:23,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:41:23,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:41:23,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:41:23,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:41:23,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:41:23,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:41:23,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:41:23,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:41:23,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:41:23,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:41:23,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:41:23,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:41:23,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:41:23,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:41:23,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:41:23,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:41:23,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:41:23,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:41:23,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:41:23,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:41:23,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:41:23,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:41:23,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:41:23,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:41:23,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:41:23,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:41:23,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:41:23,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:41:23,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:41:23,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:41:23,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:41:23,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:41:23,208 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 03:41:23,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:41:23,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:41:23,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:41:23,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:41:23,235 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:41:23,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:41:23,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:41:23,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:41:23,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:41:23,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:41:23,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:41:23,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:41:23,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:41:23,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:41:23,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:41:23,239 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:41:23,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:41:23,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:41:23,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:41:23,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:41:23,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:41:23,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2022-12-13 03:41:24,606 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:41:24,855 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:41:24,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2022-12-13 03:41:24,869 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997bcfe7b/31b0c65c382b4a3b8adf6229eb83024a/FLAG4f7e653fc [2022-12-13 03:41:24,887 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997bcfe7b/31b0c65c382b4a3b8adf6229eb83024a [2022-12-13 03:41:24,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:41:24,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:41:24,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:41:24,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:41:24,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:41:24,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:24" (1/1) ... [2022-12-13 03:41:24,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e732016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:24, skipping insertion in model container [2022-12-13 03:41:24,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:24" (1/1) ... [2022-12-13 03:41:24,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:41:24,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:41:25,065 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_69-refine-protected-loop-interval_true.i[1107,1120] [2022-12-13 03:41:25,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:41:25,196 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:41:25,206 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_69-refine-protected-loop-interval_true.i[1107,1120] [2022-12-13 03:41:25,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:41:25,275 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:41:25,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25 WrapperNode [2022-12-13 03:41:25,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:41:25,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:41:25,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:41:25,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:41:25,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,317 INFO L138 Inliner]: procedures = 165, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2022-12-13 03:41:25,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:41:25,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:41:25,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:41:25,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:41:25,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:41:25,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:41:25,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:41:25,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:41:25,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (1/1) ... [2022-12-13 03:41:25,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:41:25,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:41:25,407 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 03:41:25,412 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 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-12-13 03:41:25,434 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-12-13 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:41:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:41:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:41:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:41:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:41:25,435 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 03:41:25,519 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:41:25,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:41:25,690 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:41:25,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:41:25,696 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 03:41:25,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:25 BoogieIcfgContainer [2022-12-13 03:41:25,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:41:25,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:41:25,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:41:25,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:41:25,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:41:24" (1/3) ... [2022-12-13 03:41:25,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674800b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:25, skipping insertion in model container [2022-12-13 03:41:25,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:25" (2/3) ... [2022-12-13 03:41:25,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674800b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:25, skipping insertion in model container [2022-12-13 03:41:25,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:25" (3/3) ... [2022-12-13 03:41:25,708 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_69-refine-protected-loop-interval_true.i [2022-12-13 03:41:25,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:41:25,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:41:25,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:41:25,782 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:41:25,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 105 transitions, 215 flow [2022-12-13 03:41:25,886 INFO L130 PetriNetUnfolder]: 10/104 cut-off events. [2022-12-13 03:41:25,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:41:25,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 104 events. 10/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 03:41:25,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 105 transitions, 215 flow [2022-12-13 03:41:25,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 104 transitions, 211 flow [2022-12-13 03:41:25,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:25,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 104 transitions, 211 flow [2022-12-13 03:41:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 104 transitions, 211 flow [2022-12-13 03:41:25,956 INFO L130 PetriNetUnfolder]: 10/104 cut-off events. [2022-12-13 03:41:25,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:41:25,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 104 events. 10/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 170 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 03:41:25,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 104 transitions, 211 flow [2022-12-13 03:41:25,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 2464 [2022-12-13 03:41:28,433 INFO L241 LiptonReduction]: Total number of compositions: 80 [2022-12-13 03:41:28,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:41:28,462 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;@5ded522e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:41:28,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 03:41:28,465 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-13 03:41:28,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:41:28,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:28,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 03:41:28,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -315100603, now seen corresponding path program 1 times [2022-12-13 03:41:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803085249] [2022-12-13 03:41:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:41:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803085249] [2022-12-13 03:41:28,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803085249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:28,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:41:28,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:41:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141330932] [2022-12-13 03:41:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:28,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:41:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:41:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:41:28,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-13 03:41:28,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:28,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:28,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-13 03:41:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:29,017 INFO L130 PetriNetUnfolder]: 377/715 cut-off events. [2022-12-13 03:41:29,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:41:29,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 715 events. 377/715 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3423 event pairs, 208 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 1410. Up to 557 conditions per place. [2022-12-13 03:41:29,024 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 44 selfloop transitions, 4 changer transitions 15/68 dead transitions. [2022-12-13 03:41:29,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 265 flow [2022-12-13 03:41:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:41:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:41:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 03:41:29,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2022-12-13 03:41:29,037 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-12-13 03:41:29,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 68 transitions, 265 flow [2022-12-13 03:41:29,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 53 transitions, 205 flow [2022-12-13 03:41:29,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:41:29,045 INFO L89 Accepts]: Start accepts. Operand has 44 places, 53 transitions, 205 flow [2022-12-13 03:41:29,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:41:29,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:29,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 53 transitions, 205 flow [2022-12-13 03:41:29,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 53 transitions, 205 flow [2022-12-13 03:41:29,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 03:41:29,055 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:41:29,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:41:29,060 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 205 flow [2022-12-13 03:41:29,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:29,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:29,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:41:29,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:41:29,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1167047746, now seen corresponding path program 1 times [2022-12-13 03:41:29,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:29,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500229863] [2022-12-13 03:41:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:29,128 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 03:41:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500229863] [2022-12-13 03:41:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500229863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:29,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:41:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:41:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194820794] [2022-12-13 03:41:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:41:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:41:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:41:29,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-13 03:41:29,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 03:41:29,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:29,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-13 03:41:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:29,213 INFO L130 PetriNetUnfolder]: 210/447 cut-off events. [2022-12-13 03:41:29,217 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 03:41:29,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 447 events. 210/447 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2183 event pairs, 14 based on Foata normal form. 19/256 useless extension candidates. Maximal degree in co-relation 1256. Up to 382 conditions per place. [2022-12-13 03:41:29,222 INFO L137 encePairwiseOnDemand]: 36/43 looper letters, 40 selfloop transitions, 7 changer transitions 10/67 dead transitions. [2022-12-13 03:41:29,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 371 flow [2022-12-13 03:41:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:41:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:41:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 03:41:29,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2022-12-13 03:41:29,224 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-13 03:41:29,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 67 transitions, 371 flow [2022-12-13 03:41:29,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 57 transitions, 317 flow [2022-12-13 03:41:29,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:41:29,229 INFO L89 Accepts]: Start accepts. Operand has 43 places, 57 transitions, 317 flow [2022-12-13 03:41:29,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:41:29,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:29,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 57 transitions, 317 flow [2022-12-13 03:41:29,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 57 transitions, 317 flow [2022-12-13 03:41:29,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 03:41:29,323 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:41:29,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 03:41:29,325 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 56 transitions, 315 flow [2022-12-13 03:41:29,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 03:41:29,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:29,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:41:29,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:41:29,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1184056975, now seen corresponding path program 1 times [2022-12-13 03:41:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:29,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244577010] [2022-12-13 03:41:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:29,380 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 03:41:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:29,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244577010] [2022-12-13 03:41:29,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244577010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:29,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:41:29,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:41:29,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888869101] [2022-12-13 03:41:29,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:29,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:41:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:41:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:41:29,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 03:41:29,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 56 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:29,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:29,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 03:41:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:29,478 INFO L130 PetriNetUnfolder]: 173/372 cut-off events. [2022-12-13 03:41:29,478 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 03:41:29,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 372 events. 173/372 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1640 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 1398. Up to 361 conditions per place. [2022-12-13 03:41:29,480 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 78 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2022-12-13 03:41:29,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:41:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:41:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-13 03:41:29,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 03:41:29,482 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-13 03:41:29,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:41:29,486 INFO L89 Accepts]: Start accepts. Operand has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:41:29,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:29,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 89 transitions, 681 flow [2022-12-13 03:41:29,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 03:41:29,574 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 03:41:29,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 03:41:29,575 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 86 transitions, 669 flow [2022-12-13 03:41:29,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:29,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:29,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:41:29,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:41:29,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -65413598, now seen corresponding path program 1 times [2022-12-13 03:41:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:29,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594256289] [2022-12-13 03:41:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:29,651 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 03:41:29,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:29,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594256289] [2022-12-13 03:41:29,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594256289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:29,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:41:29,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:41:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511942058] [2022-12-13 03:41:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:29,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:41:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:41:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:41:29,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-13 03:41:29,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 86 transitions, 669 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 03:41:29,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:29,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-13 03:41:29,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:29,765 INFO L130 PetriNetUnfolder]: 232/479 cut-off events. [2022-12-13 03:41:29,765 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 03:41:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 479 events. 232/479 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2274 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 2275. Up to 467 conditions per place. [2022-12-13 03:41:29,768 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 153 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2022-12-13 03:41:29,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:41:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:41:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 03:41:29,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2022-12-13 03:41:29,771 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-12-13 03:41:29,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:41:29,777 INFO L89 Accepts]: Start accepts. Operand has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:41:29,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:29,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 165 transitions, 1621 flow [2022-12-13 03:41:29,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 03:41:29,861 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:41:29,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 03:41:29,867 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 165 transitions, 1623 flow [2022-12-13 03:41:29,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 03:41:29,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:29,869 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:41:29,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:41:29,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -824853132, now seen corresponding path program 1 times [2022-12-13 03:41:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272084053] [2022-12-13 03:41:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:41:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272084053] [2022-12-13 03:41:29,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272084053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:41:29,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687835362] [2022-12-13 03:41:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:29,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:41:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:41:29,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:41:29,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 03:41:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:30,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 03:41:30,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:41:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:41:30,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 03:41:30,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687835362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:30,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 03:41:30,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-13 03:41:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608420837] [2022-12-13 03:41:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:30,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:41:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:41:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:41:30,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 03:41:30,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 165 transitions, 1623 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:30,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:30,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 03:41:30,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:30,281 INFO L130 PetriNetUnfolder]: 245/521 cut-off events. [2022-12-13 03:41:30,281 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 03:41:30,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 521 events. 245/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2672 event pairs, 0 based on Foata normal form. 15/326 useless extension candidates. Maximal degree in co-relation 3016. Up to 510 conditions per place. [2022-12-13 03:41:30,286 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 180 selfloop transitions, 12 changer transitions 0/194 dead transitions. [2022-12-13 03:41:30,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:41:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:41:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-12-13 03:41:30,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3383458646616541 [2022-12-13 03:41:30,288 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-13 03:41:30,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:41:30,299 INFO L89 Accepts]: Start accepts. Operand has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:41:30,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:30,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 194 transitions, 2297 flow [2022-12-13 03:41:30,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 03:41:30,359 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:41:30,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 03:41:30,360 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 193 transitions, 2287 flow [2022-12-13 03:41:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:41:30,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:41:30,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:41:30,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 03:41:30,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:41:30,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 03:41:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:41:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -44193887, now seen corresponding path program 1 times [2022-12-13 03:41:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:41:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829000999] [2022-12-13 03:41:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:41:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:41:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:41:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:41:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:41:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829000999] [2022-12-13 03:41:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829000999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:41:30,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:41:30,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:41:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515252185] [2022-12-13 03:41:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:41:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:41:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:41:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:41:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:41:30,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-13 03:41:30,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 193 transitions, 2287 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 03:41:30,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:41:30,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-13 03:41:30,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:41:30,790 INFO L130 PetriNetUnfolder]: 261/556 cut-off events. [2022-12-13 03:41:30,791 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 03:41:30,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 556 events. 261/556 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2879 event pairs, 0 based on Foata normal form. 15/347 useless extension candidates. Maximal degree in co-relation 3761. Up to 543 conditions per place. [2022-12-13 03:41:30,792 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 0 selfloop transitions, 0 changer transitions 255/255 dead transitions. [2022-12-13 03:41:30,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 255 transitions, 3535 flow [2022-12-13 03:41:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:41:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:41:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-13 03:41:30,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 03:41:30,794 INFO L295 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-12-13 03:41:30,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 255 transitions, 3535 flow [2022-12-13 03:41:30,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:41:30,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:30,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:41:30,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:41:30,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:41:30,797 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:41:30,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:41:30,798 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:41:30,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 03:41:30,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-12-13 03:41:30,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 03:41:30,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-13 03:41:30,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-13 03:41:30,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 03:41:30,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:41:30,800 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 03:41:30,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:41:30,804 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:41:30,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:41:30 BasicIcfg [2022-12-13 03:41:30,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:41:30,806 INFO L158 Benchmark]: Toolchain (without parser) took 5916.24ms. Allocated memory was 255.9MB in the beginning and 343.9MB in the end (delta: 88.1MB). Free memory was 231.2MB in the beginning and 199.2MB in the end (delta: 32.1MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,806 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory was 232.0MB in the beginning and 232.0MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:41:30,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.23ms. Allocated memory is still 255.9MB. Free memory was 231.2MB in the beginning and 211.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.44ms. Allocated memory is still 255.9MB. Free memory was 211.8MB in the beginning and 209.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,807 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 255.9MB. Free memory was 209.7MB in the beginning and 208.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,807 INFO L158 Benchmark]: RCFGBuilder took 352.94ms. Allocated memory is still 255.9MB. Free memory was 208.2MB in the beginning and 193.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,807 INFO L158 Benchmark]: TraceAbstraction took 5102.35ms. Allocated memory was 255.9MB in the beginning and 343.9MB in the end (delta: 88.1MB). Free memory was 191.9MB in the beginning and 199.2MB in the end (delta: -7.3MB). Peak memory consumption was 81.9MB. Max. memory is 8.0GB. [2022-12-13 03:41:30,808 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.12ms. Allocated memory is still 255.9MB. Free memory was 232.0MB in the beginning and 232.0MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.23ms. Allocated memory is still 255.9MB. Free memory was 231.2MB in the beginning and 211.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.44ms. Allocated memory is still 255.9MB. Free memory was 211.8MB in the beginning and 209.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 255.9MB. Free memory was 209.7MB in the beginning and 208.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.94ms. Allocated memory is still 255.9MB. Free memory was 208.2MB in the beginning and 193.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5102.35ms. Allocated memory was 255.9MB in the beginning and 343.9MB in the end (delta: 88.1MB). Free memory was 191.9MB in the beginning and 199.2MB in the end (delta: -7.3MB). Peak memory consumption was 81.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 98 PlacesBefore, 44 PlacesAfterwards, 104 TransitionsBefore, 46 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3092, independent: 2991, independent conditional: 2991, independent unconditional: 0, dependent: 101, dependent conditional: 101, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3092, independent: 2991, independent conditional: 0, independent unconditional: 2991, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3092, independent: 2991, independent conditional: 0, independent unconditional: 2991, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3092, independent: 2991, independent conditional: 0, independent unconditional: 2991, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1896, independent: 1844, independent conditional: 0, independent unconditional: 1844, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1896, independent: 1828, independent conditional: 0, independent unconditional: 1828, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3092, independent: 1147, independent conditional: 0, independent unconditional: 1147, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 1896, unknown conditional: 0, unknown unconditional: 1896] , Statistics on independence cache: Total cache size (in pairs): 3863, Positive cache size: 3811, Positive conditional cache size: 0, Positive unconditional cache size: 3811, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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, 44 PlacesBefore, 44 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 162 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 42 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 4, Positive conditional cache size: 2, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 42 PlacesAfterwards, 89 TransitionsBefore, 86 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 54, independent unconditional: 38, 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: 92, independent: 92, independent conditional: 16, independent unconditional: 76, 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: 92, independent: 92, independent conditional: 16, independent unconditional: 76, 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: 29, independent: 29, independent conditional: 6, independent unconditional: 23, 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: 29, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 92, independent: 63, independent conditional: 10, independent unconditional: 53, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 29, unknown conditional: 6, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 33, Positive conditional cache size: 8, Positive unconditional cache size: 25, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 8, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 50 PlacesAfterwards, 194 TransitionsBefore, 193 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 8, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 8, Positive unconditional cache size: 30, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 135 locations, 5 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: 5.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 851 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 9 mSDtfsCounter, 851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2297occurred in iteration=5, InterpolantAutomatonStates: 30, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 195 SizeOfPredicates, 1 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:41:30,838 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...