/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:17:30,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:17:30,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:17:30,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:17:30,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:17:30,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:17:30,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:17:30,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:17:30,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:17:30,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:17:30,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:17:30,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:17:30,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:17:30,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:17:30,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:17:30,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:17:30,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:17:30,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:17:30,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:17:30,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:17:30,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:17:30,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:17:30,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:17:30,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:17:30,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:17:30,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:17:30,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:17:30,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:17:30,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:17:30,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:17:30,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:17:30,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:17:30,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:17:30,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:17:30,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:17:30,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:17:30,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:17:30,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:17:30,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:17:30,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:17:30,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:17:30,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 08:17:30,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:17:30,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:17:30,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:17:30,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:17:30,566 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:17:30,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:17:30,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:17:30,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:17:30,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:17:30,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:17:30,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:17:30,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:17:30,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:17:30,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:17:30,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:17:30,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:17:30,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:17:30,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:17:30,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:17:30,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:17:30,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2022-12-13 08:17:31,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:17:31,922 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:17:31,923 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2022-12-13 08:17:31,928 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef6be997/a3d155680d034834b3d78f628e57548e/FLAGc0f7a1f6c [2022-12-13 08:17:31,936 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef6be997/a3d155680d034834b3d78f628e57548e [2022-12-13 08:17:31,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:17:31,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:17:31,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:17:31,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:17:31,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:17:31,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:17:31" (1/1) ... [2022-12-13 08:17:31,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d705c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:31, skipping insertion in model container [2022-12-13 08:17:31,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:17:31" (1/1) ... [2022-12-13 08:17:31,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:17:31,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:17:32,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2022-12-13 08:17:32,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:17:32,072 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:17:32,102 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2022-12-13 08:17:32,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:17:32,115 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:17:32,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32 WrapperNode [2022-12-13 08:17:32,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:17:32,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:17:32,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:17:32,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:17:32,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,159 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 193 [2022-12-13 08:17:32,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:17:32,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:17:32,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:17:32,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:17:32,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,195 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:17:32,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:17:32,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:17:32,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:17:32,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (1/1) ... [2022-12-13 08:17:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:17:32,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:32,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:17:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:17:32,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:17:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:17:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 08:17:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:17:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 08:17:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:17:32,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:17:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:17:32,262 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:17:32,375 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:17:32,376 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:17:32,725 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:17:32,745 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:17:32,746 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-13 08:17:32,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:17:32 BoogieIcfgContainer [2022-12-13 08:17:32,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:17:32,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:17:32,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:17:32,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:17:32,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:17:31" (1/3) ... [2022-12-13 08:17:32,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6a68c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:17:32, skipping insertion in model container [2022-12-13 08:17:32,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:17:32" (2/3) ... [2022-12-13 08:17:32,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6a68c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:17:32, skipping insertion in model container [2022-12-13 08:17:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:17:32" (3/3) ... [2022-12-13 08:17:32,755 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2022-12-13 08:17:32,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:17:32,771 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:17:32,771 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:17:32,846 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 08:17:32,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 265 transitions, 554 flow [2022-12-13 08:17:32,957 INFO L130 PetriNetUnfolder]: 25/262 cut-off events. [2022-12-13 08:17:32,957 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:17:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 262 events. 25/262 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 174 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-13 08:17:32,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 265 transitions, 554 flow [2022-12-13 08:17:32,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 252 transitions, 522 flow [2022-12-13 08:17:32,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:33,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 252 transitions, 522 flow [2022-12-13 08:17:33,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 252 transitions, 522 flow [2022-12-13 08:17:33,043 INFO L130 PetriNetUnfolder]: 25/252 cut-off events. [2022-12-13 08:17:33,043 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:17:33,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 25/252 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 173 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-13 08:17:33,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 252 transitions, 522 flow [2022-12-13 08:17:33,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 2184 [2022-12-13 08:17:39,684 INFO L241 LiptonReduction]: Total number of compositions: 216 [2022-12-13 08:17:39,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:17:39,699 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;@58be2766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:17:39,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 08:17:39,705 INFO L130 PetriNetUnfolder]: 7/35 cut-off events. [2022-12-13 08:17:39,705 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:17:39,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:39,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:39,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1662809703, now seen corresponding path program 1 times [2022-12-13 08:17:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752588531] [2022-12-13 08:17:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:17:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752588531] [2022-12-13 08:17:40,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752588531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:17:40,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:17:40,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:17:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171022572] [2022-12-13 08:17:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:40,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:17:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:17:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:17:40,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 08:17:40,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:40,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:40,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 08:17:40,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:40,317 INFO L130 PetriNetUnfolder]: 1632/2322 cut-off events. [2022-12-13 08:17:40,317 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-13 08:17:40,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 2322 events. 1632/2322 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10455 event pairs, 885 based on Foata normal form. 2/1559 useless extension candidates. Maximal degree in co-relation 1294. Up to 755 conditions per place. [2022-12-13 08:17:40,326 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 26 selfloop transitions, 8 changer transitions 56/96 dead transitions. [2022-12-13 08:17:40,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 96 transitions, 426 flow [2022-12-13 08:17:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:17:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:17:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-13 08:17:40,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 08:17:40,337 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-13 08:17:40,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 96 transitions, 426 flow [2022-12-13 08:17:40,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 166 flow [2022-12-13 08:17:40,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:40,352 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 166 flow [2022-12-13 08:17:40,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:40,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:40,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 166 flow [2022-12-13 08:17:40,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 166 flow [2022-12-13 08:17:40,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 08:17:40,361 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:17:40,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 08:17:40,363 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 166 flow [2022-12-13 08:17:40,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:40,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:40,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:40,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:17:40,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -499238112, now seen corresponding path program 1 times [2022-12-13 08:17:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:40,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575713534] [2022-12-13 08:17:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575713534] [2022-12-13 08:17:40,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575713534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363795286] [2022-12-13 08:17:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:40,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:17:40,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 08:17:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:40,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:17:40,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:17:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:40,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:17:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:40,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363795286] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:40,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:17:40,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-13 08:17:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345437363] [2022-12-13 08:17:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:40,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:17:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:40,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:17:40,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 08:17:40,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-13 08:17:40,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:40,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:40,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-13 08:17:40,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:40,954 INFO L130 PetriNetUnfolder]: 757/1100 cut-off events. [2022-12-13 08:17:40,954 INFO L131 PetriNetUnfolder]: For 148/189 co-relation queries the response was YES. [2022-12-13 08:17:40,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 1100 events. 757/1100 cut-off events. For 148/189 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4311 event pairs, 239 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 2867. Up to 969 conditions per place. [2022-12-13 08:17:40,960 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 43 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2022-12-13 08:17:40,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:17:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:17:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 08:17:40,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 08:17:40,962 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2022-12-13 08:17:40,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:40,971 INFO L89 Accepts]: Start accepts. Operand has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:40,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:40,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 52 transitions, 316 flow [2022-12-13 08:17:40,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 08:17:41,918 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:17:41,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 948 [2022-12-13 08:17:41,919 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 51 transitions, 310 flow [2022-12-13 08:17:41,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:41,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:41,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:41,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 08:17:42,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:42,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2021976017, now seen corresponding path program 1 times [2022-12-13 08:17:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:42,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449723974] [2022-12-13 08:17:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449723974] [2022-12-13 08:17:42,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449723974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:17:42,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:17:42,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:17:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368094018] [2022-12-13 08:17:42,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:17:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:17:42,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:17:42,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-13 08:17:42,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 51 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:42,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:42,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-13 08:17:42,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:42,595 INFO L130 PetriNetUnfolder]: 1812/2609 cut-off events. [2022-12-13 08:17:42,595 INFO L131 PetriNetUnfolder]: For 2351/2389 co-relation queries the response was YES. [2022-12-13 08:17:42,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9438 conditions, 2609 events. 1812/2609 cut-off events. For 2351/2389 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11281 event pairs, 316 based on Foata normal form. 8/2117 useless extension candidates. Maximal degree in co-relation 8178. Up to 2011 conditions per place. [2022-12-13 08:17:42,609 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 121 selfloop transitions, 24 changer transitions 0/147 dead transitions. [2022-12-13 08:17:42,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:17:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:17:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-13 08:17:42,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4155405405405405 [2022-12-13 08:17:42,615 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-13 08:17:42,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:42,641 INFO L89 Accepts]: Start accepts. Operand has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:42,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:42,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 08:17:42,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:17:42,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 08:17:42,725 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 147 transitions, 1183 flow [2022-12-13 08:17:42,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:42,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:42,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:42,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:17:42,725 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1486880855, now seen corresponding path program 2 times [2022-12-13 08:17:42,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:42,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824932782] [2022-12-13 08:17:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:42,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824932782] [2022-12-13 08:17:42,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824932782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:42,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812958747] [2022-12-13 08:17:42,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:17:42,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:42,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:42,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:17:42,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 08:17:42,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:17:42,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:17:42,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 08:17:42,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:17:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:43,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:17:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:43,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812958747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:17:43,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:17:43,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 08:17:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969430562] [2022-12-13 08:17:43,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:17:43,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 08:17:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:43,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 08:17:43,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 08:17:43,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-13 08:17:43,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 147 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:43,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:43,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-13 08:17:43,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:43,696 INFO L130 PetriNetUnfolder]: 3040/4396 cut-off events. [2022-12-13 08:17:43,697 INFO L131 PetriNetUnfolder]: For 4022/4074 co-relation queries the response was YES. [2022-12-13 08:17:43,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20052 conditions, 4396 events. 3040/4396 cut-off events. For 4022/4074 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20527 event pairs, 142 based on Foata normal form. 42/3665 useless extension candidates. Maximal degree in co-relation 19104. Up to 3416 conditions per place. [2022-12-13 08:17:43,727 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 341 selfloop transitions, 89 changer transitions 0/432 dead transitions. [2022-12-13 08:17:43,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:17:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:17:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2022-12-13 08:17:43,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2022-12-13 08:17:43,729 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2022-12-13 08:17:43,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:43,767 INFO L89 Accepts]: Start accepts. Operand has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:43,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:43,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 08:17:43,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:17:43,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 08:17:43,858 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 432 transitions, 4343 flow [2022-12-13 08:17:43,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:43,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:43,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:43,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 08:17:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 08:17:44,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1784116339, now seen corresponding path program 1 times [2022-12-13 08:17:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:44,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523235980] [2022-12-13 08:17:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 08:17:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:44,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523235980] [2022-12-13 08:17:44,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523235980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:17:44,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:17:44,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:17:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660862722] [2022-12-13 08:17:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:44,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:17:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:17:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:17:44,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-13 08:17:44,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 432 transitions, 4343 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:44,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:44,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-13 08:17:44,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:44,791 INFO L130 PetriNetUnfolder]: 3648/5296 cut-off events. [2022-12-13 08:17:44,791 INFO L131 PetriNetUnfolder]: For 4522/4548 co-relation queries the response was YES. [2022-12-13 08:17:44,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29056 conditions, 5296 events. 3648/5296 cut-off events. For 4522/4548 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 25686 event pairs, 150 based on Foata normal form. 16/4399 useless extension candidates. Maximal degree in co-relation 28062. Up to 4064 conditions per place. [2022-12-13 08:17:44,820 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 483 selfloop transitions, 91 changer transitions 0/576 dead transitions. [2022-12-13 08:17:44,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:17:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:17:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-13 08:17:44,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3829787234042553 [2022-12-13 08:17:44,821 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2022-12-13 08:17:44,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:44,870 INFO L89 Accepts]: Start accepts. Operand has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:44,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:44,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 08:17:44,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:17:44,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 08:17:44,884 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 576 transitions, 6947 flow [2022-12-13 08:17:44,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:44,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:44,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:44,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:17:44,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1267280929, now seen corresponding path program 2 times [2022-12-13 08:17:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796078567] [2022-12-13 08:17:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 08:17:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796078567] [2022-12-13 08:17:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796078567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:17:45,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:17:45,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:17:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862519211] [2022-12-13 08:17:45,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:45,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:17:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:17:45,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:17:45,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-13 08:17:45,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 576 transitions, 6947 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:45,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:45,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-13 08:17:45,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:45,683 INFO L130 PetriNetUnfolder]: 3754/5440 cut-off events. [2022-12-13 08:17:45,683 INFO L131 PetriNetUnfolder]: For 5002/5028 co-relation queries the response was YES. [2022-12-13 08:17:45,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34976 conditions, 5440 events. 3754/5440 cut-off events. For 5002/5028 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 26513 event pairs, 144 based on Foata normal form. 16/4551 useless extension candidates. Maximal degree in co-relation 33846. Up to 4150 conditions per place. [2022-12-13 08:17:45,716 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 519 selfloop transitions, 63 changer transitions 0/584 dead transitions. [2022-12-13 08:17:45,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:17:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:17:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-12-13 08:17:45,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39209726443769 [2022-12-13 08:17:45,718 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2022-12-13 08:17:45,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:45,809 INFO L89 Accepts]: Start accepts. Operand has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:45,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:45,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 08:17:45,824 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:17:45,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 08:17:45,825 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 584 transitions, 8196 flow [2022-12-13 08:17:45,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:45,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:45,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:45,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:17:45,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash 408027356, now seen corresponding path program 1 times [2022-12-13 08:17:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:45,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089215526] [2022-12-13 08:17:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:45,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089215526] [2022-12-13 08:17:45,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089215526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:45,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433883332] [2022-12-13 08:17:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:45,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:45,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:45,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:17:45,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 08:17:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:46,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 08:17:46,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:17:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:46,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:17:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433883332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:17:46,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:17:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 08:17:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558166549] [2022-12-13 08:17:46,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:17:46,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:17:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:46,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:17:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-13 08:17:46,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-13 08:17:46,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 584 transitions, 8196 flow. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:46,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:46,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-13 08:17:46,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:47,102 INFO L130 PetriNetUnfolder]: 4879/7027 cut-off events. [2022-12-13 08:17:47,102 INFO L131 PetriNetUnfolder]: For 7568/7624 co-relation queries the response was YES. [2022-12-13 08:17:47,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51814 conditions, 7027 events. 4879/7027 cut-off events. For 7568/7624 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35035 event pairs, 120 based on Foata normal form. 46/5905 useless extension candidates. Maximal degree in co-relation 50253. Up to 5410 conditions per place. [2022-12-13 08:17:47,147 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 560 selfloop transitions, 149 changer transitions 0/711 dead transitions. [2022-12-13 08:17:47,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:17:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:17:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 270 transitions. [2022-12-13 08:17:47,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35904255319148937 [2022-12-13 08:17:47,149 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2022-12-13 08:17:47,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:47,300 INFO L89 Accepts]: Start accepts. Operand has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:47,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:47,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 08:17:47,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:17:47,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 08:17:47,344 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 711 transitions, 11395 flow [2022-12-13 08:17:47,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:47,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:47,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:47,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 08:17:47,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:47,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2142618506, now seen corresponding path program 2 times [2022-12-13 08:17:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:47,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876182578] [2022-12-13 08:17:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:47,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:47,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876182578] [2022-12-13 08:17:47,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876182578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:47,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903110762] [2022-12-13 08:17:47,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:17:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:47,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:47,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:17:47,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 08:17:47,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:17:47,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:17:47,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 08:17:47,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:17:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:47,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:17:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:17:47,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903110762] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:47,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:17:47,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-12-13 08:17:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217450576] [2022-12-13 08:17:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:17:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:17:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:17:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:17:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 08:17:47,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 48 [2022-12-13 08:17:47,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 711 transitions, 11395 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:47,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:17:47,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 48 [2022-12-13 08:17:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:17:48,903 INFO L130 PetriNetUnfolder]: 5475/7878 cut-off events. [2022-12-13 08:17:48,904 INFO L131 PetriNetUnfolder]: For 9758/9812 co-relation queries the response was YES. [2022-12-13 08:17:48,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65366 conditions, 7878 events. 5475/7878 cut-off events. For 9758/9812 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 39922 event pairs, 140 based on Foata normal form. 44/6629 useless extension candidates. Maximal degree in co-relation 63665. Up to 6018 conditions per place. [2022-12-13 08:17:48,952 INFO L137 encePairwiseOnDemand]: 38/48 looper letters, 649 selfloop transitions, 130 changer transitions 0/781 dead transitions. [2022-12-13 08:17:48,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:17:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:17:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-13 08:17:48,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 08:17:48,954 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2022-12-13 08:17:48,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:48,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:49,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:17:49,034 INFO L89 Accepts]: Start accepts. Operand has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:49,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:17:49,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:17:49,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:49,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:49,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-13 08:17:49,056 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:17:49,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 08:17:49,058 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 781 transitions, 14050 flow [2022-12-13 08:17:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:17:49,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:17:49,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:17:49,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 08:17:49,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:49,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:17:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:17:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1609592664, now seen corresponding path program 1 times [2022-12-13 08:17:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:17:49,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173157942] [2022-12-13 08:17:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:17:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:17:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:17:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173157942] [2022-12-13 08:17:50,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173157942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:17:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111663392] [2022-12-13 08:17:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:17:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:17:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:17:50,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:17:50,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 08:17:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:17:50,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 08:17:50,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:17:50,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:17:50,963 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 08:17:50,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 08:17:51,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:17:51,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:17:51,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:17:51,376 INFO L321 Elim1Store]: treesize reduction 150, result has 23.1 percent of original size [2022-12-13 08:17:51,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 60 [2022-12-13 08:17:51,846 INFO L321 Elim1Store]: treesize reduction 140, result has 56.8 percent of original size [2022-12-13 08:17:51,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 121 treesize of output 267 [2022-12-13 08:19:49,021 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 1990 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:20:08,867 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 1961 DAG size of output: 1959 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:21:48,774 WARN L233 SmtUtils]: Spent 12.95s on a formula simplification that was a NOOP. DAG size: 3849 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:22:58,845 WARN L233 SmtUtils]: Spent 11.02s on a formula simplification. DAG size of input: 1678 DAG size of output: 1670 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:23:06,064 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 1672 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:24:00,816 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 1468 DAG size of output: 1466 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:24:38,454 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 1984 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:26:02,631 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 2920 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 08:30:07,425 WARN L233 SmtUtils]: Spent 2.34m on a formula simplification that was a NOOP. DAG size: 6744 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-13 08:31:34,059 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 08:31:34,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 08:31:34,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:31:34,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:31:34,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:31:34,260 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ATOM-1 context. [2022-12-13 08:31:34,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 08:31:34,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 08:31:34,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 08:31:34,262 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2022-12-13 08:31:34,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:31:34,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:31:34,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:31:34 BasicIcfg [2022-12-13 08:31:34,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:31:34,267 INFO L158 Benchmark]: Toolchain (without parser) took 842328.42ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 154.3MB in the beginning and 347.1MB in the end (delta: -192.8MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-13 08:31:34,267 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:31:34,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.26ms. Allocated memory is still 178.3MB. Free memory was 154.3MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 08:31:34,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.26ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:31:34,268 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:31:34,268 INFO L158 Benchmark]: RCFGBuilder took 548.56ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 116.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 08:31:34,268 INFO L158 Benchmark]: TraceAbstraction took 841517.64ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 115.5MB in the beginning and 347.1MB in the end (delta: -231.6MB). Peak memory consumption was 972.0MB. Max. memory is 8.0GB. [2022-12-13 08:31:34,269 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.10ms. Allocated memory is still 178.3MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.26ms. Allocated memory is still 178.3MB. Free memory was 154.3MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.26ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 548.56ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 116.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 841517.64ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 115.5MB in the beginning and 347.1MB in the end (delta: -231.6MB). Peak memory consumption was 972.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 237 PlacesBefore, 39 PlacesAfterwards, 252 TransitionsBefore, 36 TransitionsAfterwards, 2184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 162 TrivialYvCompositions, 36 ConcurrentYvCompositions, 18 ChoiceCompositions, 216 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1134, independent: 1091, independent conditional: 1091, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1134, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1134, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1134, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1078, independent: 1051, independent conditional: 0, independent unconditional: 1051, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1078, independent: 1051, independent conditional: 0, independent unconditional: 1051, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1134, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1078, unknown conditional: 0, unknown unconditional: 1078] , Statistics on independence cache: Total cache size (in pairs): 1621, Positive cache size: 1594, Positive conditional cache size: 0, Positive unconditional cache size: 1594, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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): 1, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.9s, 45 PlacesBefore, 44 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 4, Positive conditional cache size: 4, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 51 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 45, independent unconditional: 15, 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: 60, independent: 60, independent conditional: 45, independent unconditional: 15, 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: 11, independent: 11, independent conditional: 8, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 60, independent: 49, independent conditional: 37, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 15, Positive conditional cache size: 12, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 432 TransitionsBefore, 432 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 155, independent conditional: 155, 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: 155, independent: 155, independent conditional: 155, 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: 155, independent: 155, independent conditional: 110, independent unconditional: 45, 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: 155, independent: 155, independent conditional: 110, independent unconditional: 45, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 155, independent: 152, independent conditional: 107, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 18, Positive conditional cache size: 15, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 576 TransitionsBefore, 576 TransitionsAfterwards, 156 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): 19, Positive cache size: 18, Positive conditional cache size: 15, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 74 PlacesBefore, 74 PlacesAfterwards, 584 TransitionsBefore, 584 TransitionsAfterwards, 164 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): 19, Positive cache size: 18, Positive conditional cache size: 15, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 89 PlacesBefore, 89 PlacesAfterwards, 711 TransitionsBefore, 711 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 33, independent unconditional: 17, 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: 50, independent: 50, independent conditional: 33, independent unconditional: 17, 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: 50, independent: 49, independent conditional: 33, independent unconditional: 16, 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): 20, Positive cache size: 19, Positive conditional cache size: 15, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 781 TransitionsBefore, 781 TransitionsAfterwards, 232 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): 20, Positive cache size: 19, Positive conditional cache size: 15, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 283 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 841.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 936 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 936 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2081 IncrementalHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 27 mSDtfsCounter, 2081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 198 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14050occurred in iteration=8, InterpolantAutomatonStates: 67, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 1477 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1336 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 50/60 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown