/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/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:59:25,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:59:25,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:59:25,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:59:25,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:59:25,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:59:25,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:59:25,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:59:25,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:59:25,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:59:25,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:59:25,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:59:25,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:59:25,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:59:25,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:59:25,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:59:25,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:59:25,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:59:25,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:59:25,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:59:25,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:59:25,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:59:25,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:59:25,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:59:25,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:59:25,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:59:25,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:59:25,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:59:25,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:59:25,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:59:25,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:59:25,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:59:25,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:59:25,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:59:25,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:59:25,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:59:25,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:59:25,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:59:25,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:59:25,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:59:25,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:59:25,435 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-06 01:59:25,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:59:25,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:59:25,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:59:25,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:59:25,469 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:59:25,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:59:25,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:59:25,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:59:25,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:59:25,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:59:25,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:59:25,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:59:25,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:59:25,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:59:25,473 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-06 01:59:25,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:59:25,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:59:25,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:59:25,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:59:25,775 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:59:25,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 01:59:26,807 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:59:26,974 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:59:26,974 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 01:59:26,981 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51e2b79b/e7a5e050044545ff841a710340a5e21e/FLAG70ff3e19b [2022-12-06 01:59:27,011 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51e2b79b/e7a5e050044545ff841a710340a5e21e [2022-12-06 01:59:27,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:59:27,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:59:27,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:59:27,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:59:27,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:59:27,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b29f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27, skipping insertion in model container [2022-12-06 01:59:27,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:59:27,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:59:27,166 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 01:59:27,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:59:27,182 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:59:27,211 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 01:59:27,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:59:27,221 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:59:27,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27 WrapperNode [2022-12-06 01:59:27,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:59:27,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:59:27,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:59:27,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:59:27,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,262 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 163 [2022-12-06 01:59:27,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:59:27,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:59:27,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:59:27,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:59:27,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:59:27,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:59:27,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:59:27,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:59:27,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (1/1) ... [2022-12-06 01:59:27,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:59:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:59:27,332 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-06 01:59:27,343 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-06 01:59:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:59:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 01:59:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 01:59:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 01:59:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 01:59:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 01:59:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 01:59:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:59:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:59:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:59:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:59:27,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:59:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:59:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:59:27,363 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:59:27,455 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:59:27,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:59:27,754 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:59:27,774 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:59:27,774 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:59:27,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:59:27 BoogieIcfgContainer [2022-12-06 01:59:27,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:59:27,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:59:27,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:59:27,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:59:27,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:59:27" (1/3) ... [2022-12-06 01:59:27,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbef6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:59:27, skipping insertion in model container [2022-12-06 01:59:27,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:59:27" (2/3) ... [2022-12-06 01:59:27,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbef6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:59:27, skipping insertion in model container [2022-12-06 01:59:27,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:59:27" (3/3) ... [2022-12-06 01:59:27,792 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-12-06 01:59:27,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:59:27,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:59:27,805 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:59:27,932 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 01:59:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 01:59:28,065 INFO L130 PetriNetUnfolder]: 13/186 cut-off events. [2022-12-06 01:59:28,066 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:59:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 13/186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 365 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-06 01:59:28,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 01:59:28,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 176 transitions, 370 flow [2022-12-06 01:59:28,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:28,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 176 transitions, 370 flow [2022-12-06 01:59:28,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 370 flow [2022-12-06 01:59:28,170 INFO L130 PetriNetUnfolder]: 13/176 cut-off events. [2022-12-06 01:59:28,171 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:59:28,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 13/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 364 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-06 01:59:28,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 176 transitions, 370 flow [2022-12-06 01:59:28,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 9384 [2022-12-06 01:59:33,512 INFO L203 LiptonReduction]: Total number of compositions: 160 [2022-12-06 01:59:33,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:59:33,530 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;@8120315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:59:33,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:59:33,534 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 01:59:33,534 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:59:33,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:33,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:33,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -674131319, now seen corresponding path program 1 times [2022-12-06 01:59:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:33,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642424265] [2022-12-06 01:59:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:34,345 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-06 01:59:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:34,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642424265] [2022-12-06 01:59:34,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642424265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:34,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:34,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077873595] [2022-12-06 01:59:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:34,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:34,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:34,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:34,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:34,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:34,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:34,537 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-06 01:59:34,538 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 01:59:34,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-06 01:59:34,540 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-06 01:59:34,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-06 01:59:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 01:59:34,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 01:59:34,552 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 01:59:34,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:34,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 45 transitions, 228 flow [2022-12-06 01:59:34,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 45 transitions, 228 flow [2022-12-06 01:59:34,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:34,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:34,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 01:59:34,565 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 45 transitions, 228 flow [2022-12-06 01:59:34,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:34,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:34,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:34,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:59:34,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1986284327, now seen corresponding path program 2 times [2022-12-06 01:59:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:34,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008127330] [2022-12-06 01:59:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:34,953 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-06 01:59:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008127330] [2022-12-06 01:59:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008127330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:34,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416849044] [2022-12-06 01:59:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:34,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:34,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 45 transitions, 228 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:34,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:34,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:34,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:35,112 INFO L130 PetriNetUnfolder]: 41/126 cut-off events. [2022-12-06 01:59:35,113 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-06 01:59:35,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 126 events. 41/126 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 472 event pairs, 0 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 296. Up to 58 conditions per place. [2022-12-06 01:59:35,113 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 44 selfloop transitions, 7 changer transitions 23/74 dead transitions. [2022-12-06 01:59:35,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 74 transitions, 522 flow [2022-12-06 01:59:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 01:59:35,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 01:59:35,115 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-06 01:59:35,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:35,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 74 transitions, 522 flow [2022-12-06 01:59:35,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 74 transitions, 522 flow [2022-12-06 01:59:35,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:35,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:35,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 01:59:35,118 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 74 transitions, 522 flow [2022-12-06 01:59:35,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:35,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:35,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:35,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:59:35,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1030021743, now seen corresponding path program 3 times [2022-12-06 01:59:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:35,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124740199] [2022-12-06 01:59:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:35,556 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-06 01:59:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124740199] [2022-12-06 01:59:35,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124740199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:35,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843639714] [2022-12-06 01:59:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:35,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:35,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:35,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 74 transitions, 522 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:35,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:35,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:35,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:35,675 INFO L130 PetriNetUnfolder]: 41/125 cut-off events. [2022-12-06 01:59:35,676 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-06 01:59:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 125 events. 41/125 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 467 event pairs, 0 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 388. Up to 61 conditions per place. [2022-12-06 01:59:35,676 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 34 selfloop transitions, 6 changer transitions 33/73 dead transitions. [2022-12-06 01:59:35,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 662 flow [2022-12-06 01:59:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 01:59:35,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 01:59:35,678 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2022-12-06 01:59:35,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:35,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 73 transitions, 662 flow [2022-12-06 01:59:35,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 73 transitions, 662 flow [2022-12-06 01:59:35,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:35,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:35,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 01:59:35,680 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 73 transitions, 662 flow [2022-12-06 01:59:35,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:35,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:35,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:35,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:59:35,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:35,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1563980471, now seen corresponding path program 4 times [2022-12-06 01:59:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:35,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94926120] [2022-12-06 01:59:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:36,089 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-06 01:59:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94926120] [2022-12-06 01:59:36,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94926120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:36,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047289005] [2022-12-06 01:59:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:36,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:36,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:36,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 73 transitions, 662 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:36,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:36,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:36,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:36,264 INFO L130 PetriNetUnfolder]: 41/124 cut-off events. [2022-12-06 01:59:36,264 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-06 01:59:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 124 events. 41/124 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 460 event pairs, 0 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 480. Up to 61 conditions per place. [2022-12-06 01:59:36,265 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 19 selfloop transitions, 5 changer transitions 60/84 dead transitions. [2022-12-06 01:59:36,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 84 transitions, 930 flow [2022-12-06 01:59:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 01:59:36,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-06 01:59:36,268 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-12-06 01:59:36,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:36,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 84 transitions, 930 flow [2022-12-06 01:59:36,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 84 transitions, 930 flow [2022-12-06 01:59:36,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:36,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:36,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 01:59:36,275 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 84 transitions, 930 flow [2022-12-06 01:59:36,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:36,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:36,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:59:36,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash -729544175, now seen corresponding path program 5 times [2022-12-06 01:59:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964832620] [2022-12-06 01:59:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:36,576 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-06 01:59:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:36,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964832620] [2022-12-06 01:59:36,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964832620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:36,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:36,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001531052] [2022-12-06 01:59:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:36,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:36,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:36,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 84 transitions, 930 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:36,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:36,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:36,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:36,760 INFO L130 PetriNetUnfolder]: 41/133 cut-off events. [2022-12-06 01:59:36,760 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 01:59:36,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 133 events. 41/133 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 527 event pairs, 0 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 619. Up to 69 conditions per place. [2022-12-06 01:59:36,761 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 16 selfloop transitions, 3 changer transitions 73/92 dead transitions. [2022-12-06 01:59:36,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 1203 flow [2022-12-06 01:59:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-06 01:59:36,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 01:59:36,762 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2022-12-06 01:59:36,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:36,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 92 transitions, 1203 flow [2022-12-06 01:59:36,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 92 transitions, 1203 flow [2022-12-06 01:59:36,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:36,764 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:36,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 01:59:36,765 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 92 transitions, 1203 flow [2022-12-06 01:59:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:36,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:36,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:59:36,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:59:36,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1474246673, now seen corresponding path program 6 times [2022-12-06 01:59:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:36,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072146831] [2022-12-06 01:59:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:36,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:37,026 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-06 01:59:37,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:37,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072146831] [2022-12-06 01:59:37,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072146831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:37,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:37,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282752109] [2022-12-06 01:59:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:37,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:37,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:37,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:59:37,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 92 transitions, 1203 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:37,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:37,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:59:37,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:37,206 INFO L130 PetriNetUnfolder]: 41/132 cut-off events. [2022-12-06 01:59:37,207 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 01:59:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 132 events. 41/132 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 538 event pairs, 0 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 719. Up to 68 conditions per place. [2022-12-06 01:59:37,207 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2022-12-06 01:59:37,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 1373 flow [2022-12-06 01:59:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:59:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:59:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-06 01:59:37,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-06 01:59:37,209 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2022-12-06 01:59:37,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:37,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 91 transitions, 1373 flow [2022-12-06 01:59:37,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 91 transitions, 1373 flow [2022-12-06 01:59:37,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:37,210 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:37,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 01:59:37,211 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 91 transitions, 1373 flow [2022-12-06 01:59:37,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:59:37,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:59:37,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:59:37,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:59:37,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:59:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:59:37,214 INFO L458 BasicCegarLoop]: Path program histogram: [6] [2022-12-06 01:59:37,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:59:37,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:59:37,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:59:37 BasicIcfg [2022-12-06 01:59:37,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:59:37,217 INFO L158 Benchmark]: Toolchain (without parser) took 10204.09ms. Allocated memory was 199.2MB in the beginning and 388.0MB in the end (delta: 188.7MB). Free memory was 175.6MB in the beginning and 328.6MB in the end (delta: -153.0MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 164.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.16ms. Allocated memory is still 199.2MB. Free memory was 164.5MB in the beginning and 162.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: Boogie Preprocessor took 33.14ms. Allocated memory is still 199.2MB. Free memory was 162.0MB in the beginning and 160.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: RCFGBuilder took 479.05ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 143.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,218 INFO L158 Benchmark]: TraceAbstraction took 9439.99ms. Allocated memory was 199.2MB in the beginning and 388.0MB in the end (delta: 188.7MB). Free memory was 142.6MB in the beginning and 328.6MB in the end (delta: -186.0MB). Peak memory consumption was 3.7MB. Max. memory is 8.0GB. [2022-12-06 01:59:37,220 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.09ms. Allocated memory is still 199.2MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.14ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 164.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.16ms. Allocated memory is still 199.2MB. Free memory was 164.5MB in the beginning and 162.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.14ms. Allocated memory is still 199.2MB. Free memory was 162.0MB in the beginning and 160.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 479.05ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 143.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9439.99ms. Allocated memory was 199.2MB in the beginning and 388.0MB in the end (delta: 188.7MB). Free memory was 142.6MB in the beginning and 328.6MB in the end (delta: -186.0MB). Peak memory consumption was 3.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 173 PlacesBefore, 26 PlacesAfterwards, 176 TransitionsBefore, 16 TransitionsAfterwards, 9384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 48 TrivialYvCompositions, 99 ConcurrentYvCompositions, 13 ChoiceCompositions, 160 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6294, independent: 6294, independent conditional: 6294, 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: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, 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: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, 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: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, 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: 5558, independent: 5558, independent conditional: 0, independent unconditional: 5558, 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: 5558, independent: 5558, independent conditional: 0, independent unconditional: 5558, 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: 6294, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5558, unknown conditional: 0, unknown unconditional: 5558] , Statistics on independence cache: Total cache size (in pairs): 12299, Positive cache size: 12299, Positive conditional cache size: 0, Positive unconditional cache size: 12299, 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.0s, 31 PlacesBefore, 31 PlacesAfterwards, 45 TransitionsBefore, 45 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): 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.0s, 36 PlacesBefore, 36 PlacesAfterwards, 74 TransitionsBefore, 74 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): 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 73 TransitionsBefore, 73 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): 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.0s, 46 PlacesBefore, 46 PlacesAfterwards, 84 TransitionsBefore, 84 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): 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.0s, 51 PlacesBefore, 51 PlacesAfterwards, 92 TransitionsBefore, 92 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): 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.0s, 55 PlacesBefore, 55 PlacesAfterwards, 91 TransitionsBefore, 91 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): 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 - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 273 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 527 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1373occurred in iteration=6, InterpolantAutomatonStates: 36, 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.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 1001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:59:37,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...