/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:15:16,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:15:16,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:15:16,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:15:16,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:15:16,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:15:16,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:15:16,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:15:16,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:15:16,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:15:16,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:15:16,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:15:16,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:15:16,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:15:16,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:15:16,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:15:16,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:15:16,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:15:16,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:15:16,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:15:16,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:15:16,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:15:16,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:15:16,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:15:16,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:15:16,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:15:16,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:15:16,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:15:16,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:15:16,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:15:16,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:15:16,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:15:16,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:15:16,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:15:16,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:15:16,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:15:16,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:15:16,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:15:16,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:15:16,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:15:16,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:15:16,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:15:16,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:15:16,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:15:16,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:15:16,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:15:16,498 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:15:16,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:15:16,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:15:16,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:15:16,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:15:16,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:15:16,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:15:16,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:15:16,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:15:16,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:15:16,501 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:15:16,501 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:15:16,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:15:16,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:15:16,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:15:16,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:15:16,783 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:15:16,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-12-13 07:15:17,945 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:15:18,135 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:15:18,135 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-12-13 07:15:18,161 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ba5656b/0207c1486b964206a45886d4e867a49e/FLAGbf4373b07 [2022-12-13 07:15:18,173 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ba5656b/0207c1486b964206a45886d4e867a49e [2022-12-13 07:15:18,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:15:18,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:15:18,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:15:18,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:15:18,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:15:18,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23967353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18, skipping insertion in model container [2022-12-13 07:15:18,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:15:18,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:15:18,311 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-subst.wvr.c[2575,2588] [2022-12-13 07:15:18,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:15:18,322 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:15:18,336 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-subst.wvr.c[2575,2588] [2022-12-13 07:15:18,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:15:18,347 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:15:18,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18 WrapperNode [2022-12-13 07:15:18,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:15:18,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:15:18,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:15:18,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:15:18,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,392 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 167 [2022-12-13 07:15:18,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:15:18,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:15:18,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:15:18,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:15:18,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,422 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:15:18,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:15:18,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:15:18,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:15:18,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (1/1) ... [2022-12-13 07:15:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:15:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:15:18,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:15:18,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:15:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:15:18,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:15:18,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:15:18,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:15:18,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:15:18,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:15:18,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:15:18,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:15:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:15:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:15:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:15:18,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:15:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:15:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:15:18,512 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:15:18,627 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:15:18,628 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:15:18,811 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:15:18,818 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:15:18,818 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 07:15:18,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:15:18 BoogieIcfgContainer [2022-12-13 07:15:18,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:15:18,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:15:18,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:15:18,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:15:18,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:15:18" (1/3) ... [2022-12-13 07:15:18,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef34785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:15:18, skipping insertion in model container [2022-12-13 07:15:18,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:15:18" (2/3) ... [2022-12-13 07:15:18,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef34785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:15:18, skipping insertion in model container [2022-12-13 07:15:18,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:15:18" (3/3) ... [2022-12-13 07:15:18,825 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2022-12-13 07:15:18,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:15:18,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:15:18,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:15:18,929 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:15:18,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 195 transitions, 414 flow [2022-12-13 07:15:19,051 INFO L130 PetriNetUnfolder]: 14/192 cut-off events. [2022-12-13 07:15:19,051 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:15:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 192 events. 14/192 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-13 07:15:19,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 195 transitions, 414 flow [2022-12-13 07:15:19,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 182 transitions, 382 flow [2022-12-13 07:15:19,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:19,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 182 transitions, 382 flow [2022-12-13 07:15:19,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 182 transitions, 382 flow [2022-12-13 07:15:19,110 INFO L130 PetriNetUnfolder]: 14/182 cut-off events. [2022-12-13 07:15:19,111 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:15:19,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 14/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-13 07:15:19,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 182 transitions, 382 flow [2022-12-13 07:15:19,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 9384 [2022-12-13 07:15:24,194 INFO L241 LiptonReduction]: Total number of compositions: 166 [2022-12-13 07:15:24,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:15:24,210 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;@564744f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:15:24,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:15:24,214 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 07:15:24,215 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:15:24,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:24,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:24,216 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-13 07:15:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1419328160, now seen corresponding path program 1 times [2022-12-13 07:15:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851945432] [2022-12-13 07:15:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:25,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:25,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851945432] [2022-12-13 07:15:25,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851945432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:25,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:25,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521067313] [2022-12-13 07:15:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:25,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:25,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:25,677 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-13 07:15:25,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:25,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:25,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:25,937 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 07:15:25,937 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 07:15:25,938 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-13 07:15:25,941 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 07:15:25,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 07:15:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 07:15:25,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 07:15:25,955 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-13 07:15:25,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 07:15:25,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 38 transitions, 191 flow [2022-12-13 07:15:25,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:25,959 INFO L89 Accepts]: Start accepts. Operand has 30 places, 38 transitions, 191 flow [2022-12-13 07:15:25,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:25,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:25,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 38 transitions, 191 flow [2022-12-13 07:15:25,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 38 transitions, 191 flow [2022-12-13 07:15:25,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:25,967 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:25,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:15:25,969 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 38 transitions, 191 flow [2022-12-13 07:15:25,969 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-13 07:15:25,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:25,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:25,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:15:25,973 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-13 07:15:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1806110336, now seen corresponding path program 2 times [2022-12-13 07:15:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:25,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663536418] [2022-12-13 07:15:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:26,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:26,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663536418] [2022-12-13 07:15:26,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663536418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:26,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:26,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910591847] [2022-12-13 07:15:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:26,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:26,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 38 transitions, 191 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-13 07:15:26,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:26,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:27,146 INFO L130 PetriNetUnfolder]: 38/116 cut-off events. [2022-12-13 07:15:27,146 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 07:15:27,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 116 events. 38/116 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 413 event pairs, 0 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 274. Up to 58 conditions per place. [2022-12-13 07:15:27,147 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 43 selfloop transitions, 7 changer transitions 15/65 dead transitions. [2022-12-13 07:15:27,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 459 flow [2022-12-13 07:15:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 07:15:27,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 07:15:27,149 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 07:15:27,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 65 transitions, 459 flow [2022-12-13 07:15:27,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 50 transitions, 351 flow [2022-12-13 07:15:27,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:27,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 50 transitions, 351 flow [2022-12-13 07:15:27,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:27,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:27,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 50 transitions, 351 flow [2022-12-13 07:15:27,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 50 transitions, 351 flow [2022-12-13 07:15:27,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:27,152 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:27,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:15:27,153 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 50 transitions, 351 flow [2022-12-13 07:15:27,153 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-13 07:15:27,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:27,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:27,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:15:27,153 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-13 07:15:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -577627930, now seen corresponding path program 3 times [2022-12-13 07:15:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:27,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576184762] [2022-12-13 07:15:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:27,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576184762] [2022-12-13 07:15:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576184762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053384523] [2022-12-13 07:15:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:27,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:27,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:27,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:27,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 50 transitions, 351 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-13 07:15:27,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:27,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:28,168 INFO L130 PetriNetUnfolder]: 28/90 cut-off events. [2022-12-13 07:15:28,168 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 07:15:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 90 events. 28/90 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 278 event pairs, 0 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 283. Up to 58 conditions per place. [2022-12-13 07:15:28,170 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 33 selfloop transitions, 6 changer transitions 10/49 dead transitions. [2022-12-13 07:15:28,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 443 flow [2022-12-13 07:15:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-13 07:15:28,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-13 07:15:28,173 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-13 07:15:28,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 49 transitions, 443 flow [2022-12-13 07:15:28,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 39 transitions, 351 flow [2022-12-13 07:15:28,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:28,175 INFO L89 Accepts]: Start accepts. Operand has 37 places, 39 transitions, 351 flow [2022-12-13 07:15:28,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:28,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:28,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 39 transitions, 351 flow [2022-12-13 07:15:28,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 39 transitions, 351 flow [2022-12-13 07:15:28,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:28,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:28,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:15:28,179 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 351 flow [2022-12-13 07:15:28,179 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-13 07:15:28,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:28,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:28,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:15:28,179 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-13 07:15:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 316705340, now seen corresponding path program 4 times [2022-12-13 07:15:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253717964] [2022-12-13 07:15:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253717964] [2022-12-13 07:15:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253717964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:28,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:28,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880279731] [2022-12-13 07:15:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:28,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:28,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 351 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-13 07:15:28,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:28,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:28,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:29,232 INFO L130 PetriNetUnfolder]: 17/59 cut-off events. [2022-12-13 07:15:29,232 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 07:15:29,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 59 events. 17/59 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 230. Up to 37 conditions per place. [2022-12-13 07:15:29,233 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 19 selfloop transitions, 5 changer transitions 19/43 dead transitions. [2022-12-13 07:15:29,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 472 flow [2022-12-13 07:15:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-13 07:15:29,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 07:15:29,234 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2022-12-13 07:15:29,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 43 transitions, 472 flow [2022-12-13 07:15:29,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 24 transitions, 261 flow [2022-12-13 07:15:29,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:29,235 INFO L89 Accepts]: Start accepts. Operand has 40 places, 24 transitions, 261 flow [2022-12-13 07:15:29,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:29,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:29,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 261 flow [2022-12-13 07:15:29,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 261 flow [2022-12-13 07:15:29,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:29,237 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:29,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 07:15:29,237 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 261 flow [2022-12-13 07:15:29,237 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-13 07:15:29,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:29,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:15:29,238 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-13 07:15:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash -201035674, now seen corresponding path program 5 times [2022-12-13 07:15:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999021923] [2022-12-13 07:15:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:29,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999021923] [2022-12-13 07:15:29,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999021923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:29,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:29,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442495959] [2022-12-13 07:15:29,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:29,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:29,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:29,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 261 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-13 07:15:29,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:29,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:29,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:30,326 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-13 07:15:30,327 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 07:15:30,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 40 events. 8/40 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2022-12-13 07:15:30,327 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 16 selfloop transitions, 3 changer transitions 13/32 dead transitions. [2022-12-13 07:15:30,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 414 flow [2022-12-13 07:15:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-12-13 07:15:30,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-13 07:15:30,329 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2022-12-13 07:15:30,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 32 transitions, 414 flow [2022-12-13 07:15:30,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 19 transitions, 246 flow [2022-12-13 07:15:30,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:30,330 INFO L89 Accepts]: Start accepts. Operand has 43 places, 19 transitions, 246 flow [2022-12-13 07:15:30,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:30,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:30,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 19 transitions, 246 flow [2022-12-13 07:15:30,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 19 transitions, 246 flow [2022-12-13 07:15:30,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:30,331 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:30,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 07:15:30,332 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 19 transitions, 246 flow [2022-12-13 07:15:30,332 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-13 07:15:30,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:30,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:30,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:15:30,332 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-13 07:15:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 543666824, now seen corresponding path program 6 times [2022-12-13 07:15:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:30,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118788153] [2022-12-13 07:15:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118788153] [2022-12-13 07:15:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118788153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:15:31,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:15:31,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:15:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456643918] [2022-12-13 07:15:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:15:31,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:15:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:15:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:15:31,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:15:31,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 19 transitions, 246 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-13 07:15:31,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:31,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:15:31,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:31,606 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-13 07:15:31,606 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:15:31,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 21 events. 3/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 102. Up to 11 conditions per place. [2022-12-13 07:15:31,609 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2022-12-13 07:15:31,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 18 transitions, 270 flow [2022-12-13 07:15:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:15:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:15:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-12-13 07:15:31,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19791666666666666 [2022-12-13 07:15:31,620 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-12-13 07:15:31,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 18 transitions, 270 flow [2022-12-13 07:15:31,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 07:15:31,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:31,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:15:31,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:15:31,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:31,621 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:31,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 07:15:31,622 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 07:15:31,623 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-13 07:15:31,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:15:31,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:15:31,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:15:31,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:15:31,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:15:31,625 INFO L445 BasicCegarLoop]: Path program histogram: [6] [2022-12-13 07:15:31,627 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:15:31,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:15:31,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:15:31 BasicIcfg [2022-12-13 07:15:31,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:15:31,637 INFO L158 Benchmark]: Toolchain (without parser) took 13461.15ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 153.5MB in the beginning and 377.0MB in the end (delta: -223.5MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,637 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:15:31,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.88ms. Allocated memory is still 176.2MB. Free memory was 153.5MB in the beginning and 141.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.07ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,637 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 176.2MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,638 INFO L158 Benchmark]: RCFGBuilder took 394.70ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 120.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,638 INFO L158 Benchmark]: TraceAbstraction took 12815.06ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 119.4MB in the beginning and 377.0MB in the end (delta: -257.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2022-12-13 07:15:31,639 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 176.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.88ms. Allocated memory is still 176.2MB. Free memory was 153.5MB in the beginning and 141.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.07ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 139.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.93ms. Allocated memory is still 176.2MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 394.70ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 120.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12815.06ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 119.4MB in the beginning and 377.0MB in the end (delta: -257.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 178 PlacesBefore, 26 PlacesAfterwards, 182 TransitionsBefore, 16 TransitionsAfterwards, 9384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 99 ConcurrentYvCompositions, 14 ChoiceCompositions, 166 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6557, independent: 6557, independent conditional: 6557, 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: 6557, independent: 6557, independent conditional: 0, independent unconditional: 6557, 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: 6557, independent: 6557, independent conditional: 0, independent unconditional: 6557, 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: 6557, independent: 6557, independent conditional: 0, independent unconditional: 6557, 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: 5858, independent: 5858, independent conditional: 0, independent unconditional: 5858, 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: 5858, independent: 5858, independent conditional: 0, independent unconditional: 5858, 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: 6557, independent: 699, independent conditional: 0, independent unconditional: 699, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5858, unknown conditional: 0, unknown unconditional: 5858] , Statistics on independence cache: Total cache size (in pairs): 12967, Positive cache size: 12967, Positive conditional cache size: 0, Positive unconditional cache size: 12967, 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, 30 PlacesBefore, 30 PlacesAfterwards, 38 TransitionsBefore, 38 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, 34 PlacesBefore, 34 PlacesAfterwards, 50 TransitionsBefore, 50 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, 37 PlacesBefore, 37 PlacesAfterwards, 39 TransitionsBefore, 39 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, 40 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 24 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, 43 PlacesBefore, 43 PlacesAfterwards, 19 TransitionsBefore, 19 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 81]: 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, 278 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: 12.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=2, 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.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2929 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-13 07:15:31,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...