/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:41,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:41,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:41,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:41,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:41,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:41,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:41,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:41,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:41,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:41,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:41,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:41,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:41,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:41,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:41,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:41,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:41,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:41,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:41,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:41,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:41,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:41,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:41,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:41,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:41,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:41,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:41,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:41,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:41,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:41,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:41,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:41,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:41,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:41,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:41,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:41,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:41,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:41,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:41,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:41,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:41,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:42:41,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:41,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:41,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:41,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:41,400 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:41,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:41,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:41,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:41,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:41,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:41,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:41,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:41,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:41,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:41,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:41,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:41,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:42:41,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:41,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:41,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:41,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:41,686 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:41,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2022-12-05 23:42:42,660 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:42,889 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:42,889 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2022-12-05 23:42:42,915 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f23ba26/0904a76ab1e242089d9cb898b2ed925b/FLAGa48a07db0 [2022-12-05 23:42:42,928 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f23ba26/0904a76ab1e242089d9cb898b2ed925b [2022-12-05 23:42:42,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:42,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:42,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:42,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:42,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:42,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:42" (1/1) ... [2022-12-05 23:42:42,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dd2bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:42, skipping insertion in model container [2022-12-05 23:42:42,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:42" (1/1) ... [2022-12-05 23:42:42,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:42,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:43,075 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2022-12-05 23:42:43,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:43,217 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:43,227 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2022-12-05 23:42:43,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:43,297 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:43,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43 WrapperNode [2022-12-05 23:42:43,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:43,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:43,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:43,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:43,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,351 INFO L138 Inliner]: procedures = 163, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 104 [2022-12-05 23:42:43,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:43,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:43,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:43,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:43,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,379 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:43,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:43,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:43,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:43,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:43,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:42:43,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:42:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:42:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-05 23:42:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-05 23:42:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:42:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:42:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:43,493 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:42:43,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:43,608 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:43,874 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:43,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:43,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:43,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:43 BoogieIcfgContainer [2022-12-05 23:42:43,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:43,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:43,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:43,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:43,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:42" (1/3) ... [2022-12-05 23:42:43,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9f52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:43, skipping insertion in model container [2022-12-05 23:42:43,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (2/3) ... [2022-12-05 23:42:43,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9f52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:43, skipping insertion in model container [2022-12-05 23:42:43,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:43" (3/3) ... [2022-12-05 23:42:43,895 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2022-12-05 23:42:43,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:43,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 23:42:43,909 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:43,975 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:42:44,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 147 transitions, 310 flow [2022-12-05 23:42:44,054 INFO L130 PetriNetUnfolder]: 4/145 cut-off events. [2022-12-05 23:42:44,054 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:42:44,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 145 events. 4/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-05 23:42:44,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 147 transitions, 310 flow [2022-12-05 23:42:44,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 127 transitions, 260 flow [2022-12-05 23:42:44,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:44,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 127 transitions, 260 flow [2022-12-05 23:42:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 127 transitions, 260 flow [2022-12-05 23:42:44,110 INFO L130 PetriNetUnfolder]: 3/127 cut-off events. [2022-12-05 23:42:44,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-05 23:42:44,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 127 transitions, 260 flow [2022-12-05 23:42:44,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 4248 [2022-12-05 23:42:47,928 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 23:42:47,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:47,944 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;@29b1088b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:47,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:42:47,947 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:42:47,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:47,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:47,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:47,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1116994421, now seen corresponding path program 1 times [2022-12-05 23:42:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294830429] [2022-12-05 23:42:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294830429] [2022-12-05 23:42:48,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294830429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734847231] [2022-12-05 23:42:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:48,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2022-12-05 23:42:48,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2022-12-05 23:42:48,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:48,264 INFO L130 PetriNetUnfolder]: 1414/2452 cut-off events. [2022-12-05 23:42:48,264 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 23:42:48,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 2452 events. 1414/2452 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 13253 event pairs, 1414 based on Foata normal form. 0/2253 useless extension candidates. Maximal degree in co-relation 4735. Up to 2272 conditions per place. [2022-12-05 23:42:48,276 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 31 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2022-12-05 23:42:48,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 146 flow [2022-12-05 23:42:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-12-05 23:42:48,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-05 23:42:48,284 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 90 flow. Second operand 2 states and 50 transitions. [2022-12-05 23:42:48,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 146 flow [2022-12-05 23:42:48,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:48,287 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 82 flow [2022-12-05 23:42:48,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-05 23:42:48,290 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-05 23:42:48,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:48,291 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 82 flow [2022-12-05 23:42:48,292 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:48,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:48,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 82 flow [2022-12-05 23:42:48,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 82 flow [2022-12-05 23:42:48,297 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-05 23:42:48,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:48,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 82 flow [2022-12-05 23:42:48,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 810 [2022-12-05 23:42:48,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:48,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-05 23:42:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 82 flow [2022-12-05 23:42:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:48,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:48,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:48,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1116984912, now seen corresponding path program 1 times [2022-12-05 23:42:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777489377] [2022-12-05 23:42:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777489377] [2022-12-05 23:42:48,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777489377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627733252] [2022-12-05 23:42:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:48,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-05 23:42:48,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-05 23:42:48,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:48,696 INFO L130 PetriNetUnfolder]: 1297/2253 cut-off events. [2022-12-05 23:42:48,696 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 2253 events. 1297/2253 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12764 event pairs, 452 based on Foata normal form. 21/2139 useless extension candidates. Maximal degree in co-relation 4356. Up to 1465 conditions per place. [2022-12-05 23:42:48,707 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-05 23:42:48,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 222 flow [2022-12-05 23:42:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-05 23:42:48,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2022-12-05 23:42:48,709 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 82 flow. Second operand 3 states and 77 transitions. [2022-12-05 23:42:48,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 222 flow [2022-12-05 23:42:48,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:48,711 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-05 23:42:48,712 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-05 23:42:48,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:48,712 INFO L89 Accepts]: Start accepts. Operand has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,712 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:48,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:48,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,717 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-05 23:42:48,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-05 23:42:48,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 786 [2022-12-05 23:42:48,728 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:48,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:42:48,730 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 94 flow [2022-12-05 23:42:48,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:48,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:48,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:48,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1727831713, now seen corresponding path program 1 times [2022-12-05 23:42:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:48,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186513196] [2022-12-05 23:42:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186513196] [2022-12-05 23:42:48,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186513196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184351904] [2022-12-05 23:42:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:48,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-05 23:42:48,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-05 23:42:48,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,095 INFO L130 PetriNetUnfolder]: 731/1430 cut-off events. [2022-12-05 23:42:49,095 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-05 23:42:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 1430 events. 731/1430 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7347 event pairs, 224 based on Foata normal form. 171/1574 useless extension candidates. Maximal degree in co-relation 3048. Up to 1145 conditions per place. [2022-12-05 23:42:49,100 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2022-12-05 23:42:49,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 311 flow [2022-12-05 23:42:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-05 23:42:49,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-05 23:42:49,103 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 94 flow. Second operand 4 states and 80 transitions. [2022-12-05 23:42:49,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 311 flow [2022-12-05 23:42:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:49,107 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-05 23:42:49,108 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2022-12-05 23:42:49,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,108 INFO L89 Accepts]: Start accepts. Operand has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,108 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,118 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-05 23:42:49,119 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:42:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 129 events. 12/129 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 513 event pairs, 6 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 188. Up to 23 conditions per place. [2022-12-05 23:42:49,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 782 [2022-12-05 23:42:49,153 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:49,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-05 23:42:49,154 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 119 flow [2022-12-05 23:42:49,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:49,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1863751913, now seen corresponding path program 1 times [2022-12-05 23:42:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999621777] [2022-12-05 23:42:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999621777] [2022-12-05 23:42:49,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999621777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121736429] [2022-12-05 23:42:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:49,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-05 23:42:49,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-05 23:42:49,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,334 INFO L130 PetriNetUnfolder]: 482/1048 cut-off events. [2022-12-05 23:42:49,334 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-05 23:42:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1048 events. 482/1048 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5570 event pairs, 98 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 2368. Up to 752 conditions per place. [2022-12-05 23:42:49,338 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 51 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-05 23:42:49,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 281 flow [2022-12-05 23:42:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-05 23:42:49,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6495726495726496 [2022-12-05 23:42:49,339 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 119 flow. Second operand 3 states and 76 transitions. [2022-12-05 23:42:49,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 281 flow [2022-12-05 23:42:49,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:49,341 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-05 23:42:49,341 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2022-12-05 23:42:49,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,341 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,342 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,349 INFO L130 PetriNetUnfolder]: 12/131 cut-off events. [2022-12-05 23:42:49,349 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:42:49,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 131 events. 12/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 540 event pairs, 8 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 197. Up to 23 conditions per place. [2022-12-05 23:42:49,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-05 23:42:49,359 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:49,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-05 23:42:49,360 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 126 flow [2022-12-05 23:42:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:49,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1809141128, now seen corresponding path program 1 times [2022-12-05 23:42:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113339453] [2022-12-05 23:42:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113339453] [2022-12-05 23:42:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113339453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031920692] [2022-12-05 23:42:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:49,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-05 23:42:49,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-05 23:42:49,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,593 INFO L130 PetriNetUnfolder]: 435/984 cut-off events. [2022-12-05 23:42:49,593 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-05 23:42:49,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 984 events. 435/984 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5465 event pairs, 300 based on Foata normal form. 43/1020 useless extension candidates. Maximal degree in co-relation 2312. Up to 618 conditions per place. [2022-12-05 23:42:49,596 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 67 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2022-12-05 23:42:49,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 370 flow [2022-12-05 23:42:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:42:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:42:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-05 23:42:49,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5743589743589743 [2022-12-05 23:42:49,598 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 126 flow. Second operand 5 states and 112 transitions. [2022-12-05 23:42:49,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 370 flow [2022-12-05 23:42:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:49,599 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-05 23:42:49,600 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-05 23:42:49,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,600 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,601 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,608 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-05 23:42:49,608 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 23:42:49,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 140 events. 14/140 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 9 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 238. Up to 29 conditions per place. [2022-12-05 23:42:49,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-05 23:42:49,637 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:49,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 23:42:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 139 flow [2022-12-05 23:42:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:42:49,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1435581926, now seen corresponding path program 1 times [2022-12-05 23:42:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891621451] [2022-12-05 23:42:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891621451] [2022-12-05 23:42:49,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891621451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:42:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345955772] [2022-12-05 23:42:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:49,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-05 23:42:49,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-05 23:42:49,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,892 INFO L130 PetriNetUnfolder]: 452/1130 cut-off events. [2022-12-05 23:42:49,892 INFO L131 PetriNetUnfolder]: For 446/446 co-relation queries the response was YES. [2022-12-05 23:42:49,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3009 conditions, 1130 events. 452/1130 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6414 event pairs, 217 based on Foata normal form. 219/1349 useless extension candidates. Maximal degree in co-relation 2994. Up to 584 conditions per place. [2022-12-05 23:42:49,896 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 49 selfloop transitions, 19 changer transitions 1/71 dead transitions. [2022-12-05 23:42:49,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 377 flow [2022-12-05 23:42:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-05 23:42:49,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-05 23:42:49,897 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 139 flow. Second operand 4 states and 80 transitions. [2022-12-05 23:42:49,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 377 flow [2022-12-05 23:42:49,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 365 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:49,899 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 235 flow [2022-12-05 23:42:49,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-05 23:42:49,900 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-05 23:42:49,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,900 INFO L89 Accepts]: Start accepts. Operand has 54 places, 52 transitions, 235 flow [2022-12-05 23:42:49,901 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 235 flow [2022-12-05 23:42:49,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 235 flow [2022-12-05 23:42:49,927 INFO L130 PetriNetUnfolder]: 133/563 cut-off events. [2022-12-05 23:42:49,927 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-05 23:42:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 563 events. 133/563 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3567 event pairs, 79 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 1367. Up to 222 conditions per place. [2022-12-05 23:42:49,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 235 flow [2022-12-05 23:42:49,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-05 23:42:50,182 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 23:42:50,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-05 23:42:50,183 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 222 flow [2022-12-05 23:42:50,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:50,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:42:50,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -92009035, now seen corresponding path program 1 times [2022-12-05 23:42:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859402223] [2022-12-05 23:42:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:50,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859402223] [2022-12-05 23:42:50,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859402223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:42:50,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476058986] [2022-12-05 23:42:50,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:50,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:50,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-05 23:42:50,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-05 23:42:50,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,381 INFO L130 PetriNetUnfolder]: 112/353 cut-off events. [2022-12-05 23:42:50,381 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-05 23:42:50,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 353 events. 112/353 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1553 event pairs, 20 based on Foata normal form. 40/393 useless extension candidates. Maximal degree in co-relation 1187. Up to 328 conditions per place. [2022-12-05 23:42:50,383 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 33 selfloop transitions, 5 changer transitions 8/48 dead transitions. [2022-12-05 23:42:50,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 315 flow [2022-12-05 23:42:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 23:42:50,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3223684210526316 [2022-12-05 23:42:50,384 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 222 flow. Second operand 4 states and 49 transitions. [2022-12-05 23:42:50,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 315 flow [2022-12-05 23:42:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 309 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:50,385 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 161 flow [2022-12-05 23:42:50,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-05 23:42:50,386 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-05 23:42:50,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,386 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 161 flow [2022-12-05 23:42:50,387 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 161 flow [2022-12-05 23:42:50,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 161 flow [2022-12-05 23:42:50,395 INFO L130 PetriNetUnfolder]: 26/171 cut-off events. [2022-12-05 23:42:50,395 INFO L131 PetriNetUnfolder]: For 54/62 co-relation queries the response was YES. [2022-12-05 23:42:50,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 171 events. 26/171 cut-off events. For 54/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 785 event pairs, 17 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 408. Up to 67 conditions per place. [2022-12-05 23:42:50,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 161 flow [2022-12-05 23:42:50,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-05 23:42:50,700 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 23:42:50,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-05 23:42:50,701 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 117 flow [2022-12-05 23:42:50,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:50,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:42:50,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1196255947, now seen corresponding path program 1 times [2022-12-05 23:42:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586882174] [2022-12-05 23:42:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586882174] [2022-12-05 23:42:50,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586882174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:42:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247298345] [2022-12-05 23:42:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:42:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:42:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:42:50,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 23:42:50,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 23:42:50,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,886 INFO L130 PetriNetUnfolder]: 30/110 cut-off events. [2022-12-05 23:42:50,886 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-05 23:42:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 110 events. 30/110 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 380 event pairs, 13 based on Foata normal form. 8/118 useless extension candidates. Maximal degree in co-relation 410. Up to 58 conditions per place. [2022-12-05 23:42:50,887 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 20 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-12-05 23:42:50,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 198 flow [2022-12-05 23:42:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:42:50,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-05 23:42:50,888 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 117 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:42:50,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 198 flow [2022-12-05 23:42:50,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 178 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:50,892 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 105 flow [2022-12-05 23:42:50,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-05 23:42:50,894 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -12 predicate places. [2022-12-05 23:42:50,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,894 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 105 flow [2022-12-05 23:42:50,894 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 105 flow [2022-12-05 23:42:50,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 105 flow [2022-12-05 23:42:50,899 INFO L130 PetriNetUnfolder]: 14/78 cut-off events. [2022-12-05 23:42:50,899 INFO L131 PetriNetUnfolder]: For 43/50 co-relation queries the response was YES. [2022-12-05 23:42:50,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 78 events. 14/78 cut-off events. For 43/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 282 event pairs, 13 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 206. Up to 40 conditions per place. [2022-12-05 23:42:50,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 105 flow [2022-12-05 23:42:50,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 23:42:51,028 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:42:51,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-05 23:42:51,029 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 99 flow [2022-12-05 23:42:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:51,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:51,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:42:51,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:42:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -498062832, now seen corresponding path program 1 times [2022-12-05 23:42:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072437413] [2022-12-05 23:42:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:51,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072437413] [2022-12-05 23:42:51,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072437413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522591866] [2022-12-05 23:42:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:51,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:42:51,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:51,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:42:51,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:51,132 INFO L130 PetriNetUnfolder]: 30/87 cut-off events. [2022-12-05 23:42:51,132 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-05 23:42:51,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 87 events. 30/87 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 276 event pairs, 21 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 334. Up to 67 conditions per place. [2022-12-05 23:42:51,132 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 0 selfloop transitions, 0 changer transitions 23/23 dead transitions. [2022-12-05 23:42:51,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 165 flow [2022-12-05 23:42:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 23:42:51,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 23:42:51,133 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 99 flow. Second operand 4 states and 28 transitions. [2022-12-05 23:42:51,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 165 flow [2022-12-05 23:42:51,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 155 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:51,134 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2022-12-05 23:42:51,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2022-12-05 23:42:51,134 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -18 predicate places. [2022-12-05 23:42:51,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:51,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 0 transitions, 0 flow [2022-12-05 23:42:51,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,135 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:51,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:51,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:42:51,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:51,135 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:51,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:42:51,136 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:51,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:42:51,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-05 23:42:51,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:42:51,138 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:51,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:51,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:51,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:51 BasicIcfg [2022-12-05 23:42:51,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:51,142 INFO L158 Benchmark]: Toolchain (without parser) took 8211.95ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 229.7MB in the beginning and 248.0MB in the end (delta: -18.3MB). Peak memory consumption was 139.5MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 231.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.24ms. Allocated memory is still 255.9MB. Free memory was 229.7MB in the beginning and 209.7MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.69ms. Allocated memory is still 255.9MB. Free memory was 209.7MB in the beginning and 207.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 255.9MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: RCFGBuilder took 496.30ms. Allocated memory is still 255.9MB. Free memory was 206.1MB in the beginning and 188.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,143 INFO L158 Benchmark]: TraceAbstraction took 7258.84ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 187.7MB in the beginning and 248.0MB in the end (delta: -60.3MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. [2022-12-05 23:42:51,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 231.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 365.24ms. Allocated memory is still 255.9MB. Free memory was 229.7MB in the beginning and 209.7MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.69ms. Allocated memory is still 255.9MB. Free memory was 209.7MB in the beginning and 207.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 255.9MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 496.30ms. Allocated memory is still 255.9MB. Free memory was 206.1MB in the beginning and 188.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7258.84ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 187.7MB in the beginning and 248.0MB in the end (delta: -60.3MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 131 PlacesBefore, 46 PlacesAfterwards, 127 TransitionsBefore, 42 TransitionsAfterwards, 4248 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 51 ConcurrentYvCompositions, 0 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3142, independent: 2954, independent conditional: 2954, independent unconditional: 0, dependent: 188, dependent conditional: 188, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3142, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3142, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3142, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2428, independent: 2338, independent conditional: 0, independent unconditional: 2338, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2428, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 283, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 274, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3142, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 2428, unknown conditional: 0, unknown unconditional: 2428] , Statistics on independence cache: Total cache size (in pairs): 3725, Positive cache size: 3635, Positive conditional cache size: 0, Positive unconditional cache size: 3635, Negative cache size: 90, Negative conditional cache size: 0, Negative unconditional cache size: 90, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 338, independent conditional: 338, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 398, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 398, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 349, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 349, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 398, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 349, unknown conditional: 0, unknown unconditional: 349] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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, 47 PlacesBefore, 47 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 317, independent conditional: 317, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 317, independent conditional: 33, independent unconditional: 284, dependent: 56, dependent conditional: 5, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 373, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 56, dependent conditional: 5, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 373, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 56, dependent conditional: 5, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 373, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 59, Negative conditional cache size: 4, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 358, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 358, independent: 306, independent conditional: 65, independent unconditional: 241, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 358, independent: 306, independent conditional: 65, independent unconditional: 241, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 358, independent: 306, independent conditional: 65, independent unconditional: 241, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 358, independent: 288, independent conditional: 51, independent unconditional: 237, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 29, unknown conditional: 14, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 314, Positive conditional cache size: 14, Positive unconditional cache size: 300, Negative cache size: 70, Negative conditional cache size: 4, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 273, independent conditional: 273, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323, independent: 273, independent conditional: 77, independent unconditional: 196, dependent: 50, dependent conditional: 3, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 323, independent: 273, independent conditional: 77, independent unconditional: 196, dependent: 50, dependent conditional: 3, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 323, independent: 273, independent conditional: 77, independent unconditional: 196, dependent: 50, dependent conditional: 3, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 323, independent: 273, independent conditional: 77, independent unconditional: 196, dependent: 42, dependent conditional: 1, dependent unconditional: 41, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 314, Positive conditional cache size: 14, Positive unconditional cache size: 300, Negative cache size: 78, Negative conditional cache size: 6, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, independent: 243, independent conditional: 243, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 296, independent: 243, independent conditional: 129, independent unconditional: 114, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, independent: 243, independent conditional: 129, independent unconditional: 114, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, independent: 243, independent conditional: 129, independent unconditional: 114, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 4, independent unconditional: 14, dependent: 22, dependent conditional: 13, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 22, dependent conditional: 13, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 6, independent conditional: 3, independent unconditional: 2, dependent: 20, dependent conditional: 13, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, independent: 225, independent conditional: 125, independent unconditional: 100, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 40, unknown conditional: 17, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 332, Positive conditional cache size: 18, Positive unconditional cache size: 314, Negative cache size: 100, Negative conditional cache size: 19, Negative unconditional cache size: 81, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 54 PlacesBefore, 50 PlacesAfterwards, 52 TransitionsBefore, 46 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 227, independent: 205, independent conditional: 147, independent unconditional: 58, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, independent: 205, independent conditional: 147, independent unconditional: 58, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 205, independent conditional: 147, independent unconditional: 58, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 36, independent unconditional: 4, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 165, independent conditional: 111, independent unconditional: 54, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 45, unknown conditional: 39, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 431, Positive conditional cache size: 54, Positive unconditional cache size: 377, Negative cache size: 105, Negative conditional cache size: 22, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 22 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 47, independent unconditional: 21, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 68, independent conditional: 47, independent unconditional: 21, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 47, independent unconditional: 21, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 56, independent conditional: 38, independent unconditional: 18, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 551, Positive conditional cache size: 63, Positive unconditional cache size: 488, Negative cache size: 105, Negative conditional cache size: 22, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 561, Positive conditional cache size: 63, Positive unconditional cache size: 498, Negative cache size: 105, Negative conditional cache size: 22, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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): 666, Positive cache size: 561, Positive conditional cache size: 63, Positive unconditional cache size: 498, Negative cache size: 105, Negative conditional cache size: 22, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 184 locations, 6 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: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 2 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:51,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...