/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-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:45:07,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:45:07,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:45:07,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:45:07,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:45:07,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:45:07,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:45:07,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:45:08,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:45:08,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:45:08,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:45:08,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:45:08,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:45:08,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:45:08,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:45:08,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:45:08,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:45:08,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:45:08,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:45:08,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:45:08,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:45:08,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:45:08,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:45:08,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:45:08,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:45:08,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:45:08,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:45:08,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:45:08,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:45:08,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:45:08,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:45:08,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:45:08,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:45:08,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:45:08,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:45:08,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:45:08,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:45:08,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:45:08,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:45:08,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:45:08,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:45:08,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:45:08,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:45:08,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:45:08,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:45:08,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:45:08,083 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:45:08,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:45:08,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:45:08,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:45:08,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:45:08,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:45:08,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:45:08,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:45:08,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:45:08,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:45:08,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:45:08,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:45:08,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:45:08,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:45:08,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:45:08,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:45:08,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:45:08,365 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:45:08,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-13 07:45:09,340 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:45:09,537 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:45:09,538 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-13 07:45:09,546 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66989b8b/6931924b692c46f199c8a2288d236162/FLAG8cadc1813 [2022-12-13 07:45:09,558 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66989b8b/6931924b692c46f199c8a2288d236162 [2022-12-13 07:45:09,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:45:09,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:45:09,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:45:09,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:45:09,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:45:09,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5360fcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09, skipping insertion in model container [2022-12-13 07:45:09,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:45:09,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:45:09,697 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-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-13 07:45:09,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:45:09,710 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:45:09,725 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-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-13 07:45:09,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:45:09,738 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:45:09,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09 WrapperNode [2022-12-13 07:45:09,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:45:09,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:45:09,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:45:09,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:45:09,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,795 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-12-13 07:45:09,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:45:09,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:45:09,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:45:09,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:45:09,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,848 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:45:09,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:45:09,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:45:09,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:45:09,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (1/1) ... [2022-12-13 07:45:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:45:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:09,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:45:09,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:45:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:45:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:45:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:45:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:45:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:45:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:45:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:45:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:45:09,941 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:45:10,072 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:45:10,084 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:45:10,423 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:45:10,434 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:45:10,434 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 07:45:10,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:10 BoogieIcfgContainer [2022-12-13 07:45:10,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:45:10,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:45:10,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:45:10,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:45:10,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:45:09" (1/3) ... [2022-12-13 07:45:10,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb24035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:10, skipping insertion in model container [2022-12-13 07:45:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:09" (2/3) ... [2022-12-13 07:45:10,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb24035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:10, skipping insertion in model container [2022-12-13 07:45:10,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:10" (3/3) ... [2022-12-13 07:45:10,463 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-12-13 07:45:10,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:45:10,480 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:45:10,480 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:45:10,616 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:45:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 317 transitions, 658 flow [2022-12-13 07:45:10,775 INFO L130 PetriNetUnfolder]: 29/314 cut-off events. [2022-12-13 07:45:10,776 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:45:10,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 29/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 427 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-13 07:45:10,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 317 transitions, 658 flow [2022-12-13 07:45:10,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 304 transitions, 626 flow [2022-12-13 07:45:10,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:10,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-13 07:45:10,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 304 transitions, 626 flow [2022-12-13 07:45:10,882 INFO L130 PetriNetUnfolder]: 29/304 cut-off events. [2022-12-13 07:45:10,883 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:45:10,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 304 events. 29/304 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 422 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-13 07:45:10,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-13 07:45:10,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 12810 [2022-12-13 07:45:20,243 INFO L241 LiptonReduction]: Total number of compositions: 276 [2022-12-13 07:45:20,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:45:20,270 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;@4ed6891b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:45:20,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:45:20,276 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 07:45:20,276 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:45:20,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:20,276 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] [2022-12-13 07:45:20,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1440705028, now seen corresponding path program 1 times [2022-12-13 07:45:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:20,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892687431] [2022-12-13 07:45:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:45:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892687431] [2022-12-13 07:45:20,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892687431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:20,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:20,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:45:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458665967] [2022-12-13 07:45:20,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:20,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:45:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:45:20,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:45:20,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 07:45:20,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:20,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:20,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 07:45:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:21,017 INFO L130 PetriNetUnfolder]: 362/512 cut-off events. [2022-12-13 07:45:21,017 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 07:45:21,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 512 events. 362/512 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1612 event pairs, 39 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-13 07:45:21,023 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-13 07:45:21,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-13 07:45:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:45:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:45:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-13 07:45:21,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 07:45:21,034 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-13 07:45:21,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 44 transitions, 203 flow [2022-12-13 07:45:21,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 43 transitions, 196 flow [2022-12-13 07:45:21,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:21,040 INFO L89 Accepts]: Start accepts. Operand has 34 places, 43 transitions, 196 flow [2022-12-13 07:45:21,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:21,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:21,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 43 transitions, 196 flow [2022-12-13 07:45:21,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 43 transitions, 196 flow [2022-12-13 07:45:21,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 07:45:21,053 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:21,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:45:21,055 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 43 transitions, 196 flow [2022-12-13 07:45:21,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:21,056 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 07:45:21,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:45:21,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 638595226, now seen corresponding path program 1 times [2022-12-13 07:45:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545606615] [2022-12-13 07:45:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:45:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545606615] [2022-12-13 07:45:21,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545606615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:21,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:21,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:45:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670637340] [2022-12-13 07:45:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:45:21,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:21,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 43 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:21,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:21,375 INFO L130 PetriNetUnfolder]: 681/997 cut-off events. [2022-12-13 07:45:21,376 INFO L131 PetriNetUnfolder]: For 248/252 co-relation queries the response was YES. [2022-12-13 07:45:21,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 997 events. 681/997 cut-off events. For 248/252 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3931 event pairs, 86 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 1193. Up to 705 conditions per place. [2022-12-13 07:45:21,382 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 87 selfloop transitions, 10 changer transitions 4/103 dead transitions. [2022-12-13 07:45:21,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 103 transitions, 678 flow [2022-12-13 07:45:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:45:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:45:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 07:45:21,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-13 07:45:21,385 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 07:45:21,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 103 transitions, 678 flow [2022-12-13 07:45:21,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 99 transitions, 648 flow [2022-12-13 07:45:21,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:21,393 INFO L89 Accepts]: Start accepts. Operand has 38 places, 99 transitions, 648 flow [2022-12-13 07:45:21,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:21,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:21,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 99 transitions, 648 flow [2022-12-13 07:45:21,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 99 transitions, 648 flow [2022-12-13 07:45:21,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 07:45:21,399 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:21,400 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:45:21,400 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 99 transitions, 648 flow [2022-12-13 07:45:21,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:21,400 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 07:45:21,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:45:21,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash -574008586, now seen corresponding path program 1 times [2022-12-13 07:45:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:21,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192339462] [2022-12-13 07:45:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:45:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192339462] [2022-12-13 07:45:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192339462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:21,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:45:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860714677] [2022-12-13 07:45:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:45:21,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:21,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 99 transitions, 648 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:21,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:21,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:21,690 INFO L130 PetriNetUnfolder]: 638/971 cut-off events. [2022-12-13 07:45:21,690 INFO L131 PetriNetUnfolder]: For 657/669 co-relation queries the response was YES. [2022-12-13 07:45:21,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 971 events. 638/971 cut-off events. For 657/669 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4031 event pairs, 115 based on Foata normal form. 12/750 useless extension candidates. Maximal degree in co-relation 1615. Up to 546 conditions per place. [2022-12-13 07:45:21,695 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 97 selfloop transitions, 10 changer transitions 12/122 dead transitions. [2022-12-13 07:45:21,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 122 transitions, 1038 flow [2022-12-13 07:45:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:45:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:45:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 07:45:21,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-13 07:45:21,698 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-13 07:45:21,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 122 transitions, 1038 flow [2022-12-13 07:45:21,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 110 transitions, 930 flow [2022-12-13 07:45:21,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:21,707 INFO L89 Accepts]: Start accepts. Operand has 42 places, 110 transitions, 930 flow [2022-12-13 07:45:21,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:21,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:21,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 110 transitions, 930 flow [2022-12-13 07:45:21,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 110 transitions, 930 flow [2022-12-13 07:45:21,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 07:45:21,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:21,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:45:21,712 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 110 transitions, 930 flow [2022-12-13 07:45:21,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:21,712 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 07:45:21,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:45:21,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash 923479627, now seen corresponding path program 1 times [2022-12-13 07:45:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:21,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564431487] [2022-12-13 07:45:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:45:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564431487] [2022-12-13 07:45:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564431487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:21,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:45:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897362031] [2022-12-13 07:45:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:45:21,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:21,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 110 transitions, 930 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:21,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:21,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:21,979 INFO L130 PetriNetUnfolder]: 478/737 cut-off events. [2022-12-13 07:45:21,979 INFO L131 PetriNetUnfolder]: For 998/1010 co-relation queries the response was YES. [2022-12-13 07:45:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 737 events. 478/737 cut-off events. For 998/1010 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2520 event pairs, 142 based on Foata normal form. 48/613 useless extension candidates. Maximal degree in co-relation 2101. Up to 534 conditions per place. [2022-12-13 07:45:21,984 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 38 selfloop transitions, 6 changer transitions 39/85 dead transitions. [2022-12-13 07:45:21,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 865 flow [2022-12-13 07:45:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:45:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:45:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 07:45:21,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 07:45:21,986 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 07:45:21,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 85 transitions, 865 flow [2022-12-13 07:45:21,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 46 transitions, 472 flow [2022-12-13 07:45:21,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:21,994 INFO L89 Accepts]: Start accepts. Operand has 40 places, 46 transitions, 472 flow [2022-12-13 07:45:21,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:21,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:21,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 46 transitions, 472 flow [2022-12-13 07:45:21,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 46 transitions, 472 flow [2022-12-13 07:45:21,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:45:21,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:21,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:45:21,998 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 46 transitions, 472 flow [2022-12-13 07:45:21,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:21,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:21,999 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] [2022-12-13 07:45:21,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:45:21,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1913999005, now seen corresponding path program 1 times [2022-12-13 07:45:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323044301] [2022-12-13 07:45:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:22,115 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 07:45:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323044301] [2022-12-13 07:45:22,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323044301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886994422] [2022-12-13 07:45:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:22,131 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 07:45:22,149 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 07:45:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:22,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:45:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:22,346 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 07:45:22,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:22,395 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 07:45:22,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886994422] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:22,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:45:22,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-13 07:45:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401135784] [2022-12-13 07:45:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:45:22,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:22,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 46 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:22,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:22,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:22,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:22,500 INFO L130 PetriNetUnfolder]: 368/542 cut-off events. [2022-12-13 07:45:22,500 INFO L131 PetriNetUnfolder]: For 921/963 co-relation queries the response was YES. [2022-12-13 07:45:22,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 542 events. 368/542 cut-off events. For 921/963 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1674 event pairs, 67 based on Foata normal form. 6/417 useless extension candidates. Maximal degree in co-relation 2671. Up to 469 conditions per place. [2022-12-13 07:45:22,503 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 51 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-13 07:45:22,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:45:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:45:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 07:45:22,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-13 07:45:22,505 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-13 07:45:22,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:22,510 INFO L89 Accepts]: Start accepts. Operand has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:22,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:22,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 58 transitions, 707 flow [2022-12-13 07:45:22,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:45:23,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:45:23,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 968 [2022-12-13 07:45:23,478 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 57 transitions, 695 flow [2022-12-13 07:45:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:23,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:23,478 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] [2022-12-13 07:45:23,493 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 07:45:23,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:23,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 989859665, now seen corresponding path program 1 times [2022-12-13 07:45:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743279189] [2022-12-13 07:45:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:45:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743279189] [2022-12-13 07:45:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743279189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:23,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:23,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:45:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171158724] [2022-12-13 07:45:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:23,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:23,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:23,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:45:23,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:23,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 57 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:23,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:23,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:23,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:23,906 INFO L130 PetriNetUnfolder]: 439/626 cut-off events. [2022-12-13 07:45:23,906 INFO L131 PetriNetUnfolder]: For 2383/2535 co-relation queries the response was YES. [2022-12-13 07:45:23,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 626 events. 439/626 cut-off events. For 2383/2535 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2033 event pairs, 55 based on Foata normal form. 14/499 useless extension candidates. Maximal degree in co-relation 3803. Up to 570 conditions per place. [2022-12-13 07:45:23,911 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 73 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2022-12-13 07:45:23,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:45:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:45:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 07:45:23,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2022-12-13 07:45:23,914 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 07:45:23,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:23,921 INFO L89 Accepts]: Start accepts. Operand has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:23,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:23,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:45:23,925 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:23,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:45:23,926 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 81 transitions, 1153 flow [2022-12-13 07:45:23,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:23,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:23,926 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] [2022-12-13 07:45:23,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:45:23,926 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 07:45:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1358412831, now seen corresponding path program 1 times [2022-12-13 07:45:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818655342] [2022-12-13 07:45:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:24,064 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 07:45:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818655342] [2022-12-13 07:45:24,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818655342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:45:24,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:45:24,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:45:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269362790] [2022-12-13 07:45:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:45:24,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:45:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:45:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:45:24,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:45:24,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 81 transitions, 1153 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:24,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:24,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:45:24,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:24,188 INFO L130 PetriNetUnfolder]: 492/705 cut-off events. [2022-12-13 07:45:24,189 INFO L131 PetriNetUnfolder]: For 3508/3664 co-relation queries the response was YES. [2022-12-13 07:45:24,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 705 events. 492/705 cut-off events. For 3508/3664 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2311 event pairs, 48 based on Foata normal form. 14/578 useless extension candidates. Maximal degree in co-relation 4929. Up to 649 conditions per place. [2022-12-13 07:45:24,194 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 96 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2022-12-13 07:45:24,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:45:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:45:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 07:45:24,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2022-12-13 07:45:24,197 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2022-12-13 07:45:24,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:24,208 INFO L89 Accepts]: Start accepts. Operand has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:24,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:24,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 07:45:24,213 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:24,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:45:24,216 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 107 transitions, 1736 flow [2022-12-13 07:45:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:24,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:24,216 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 07:45:24,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:45:24,216 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 07:45:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash 430075587, now seen corresponding path program 1 times [2022-12-13 07:45:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:24,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112727109] [2022-12-13 07:45:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:25,221 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 07:45:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:25,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112727109] [2022-12-13 07:45:25,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112727109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:25,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438230580] [2022-12-13 07:45:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:25,225 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 07:45:25,292 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 07:45:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:25,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:45:25,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:25,410 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 07:45:25,444 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:45:25,445 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 07:45:25,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:25,715 INFO L321 Elim1Store]: treesize reduction 67, result has 22.1 percent of original size [2022-12-13 07:45:25,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 41 [2022-12-13 07:45:25,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:25,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 106 [2022-12-13 07:45:25,979 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 07:45:25,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:27,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:27,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 42 [2022-12-13 07:45:27,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:27,653 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:27,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:27,812 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 07:45:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438230580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:27,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2022-12-13 07:45:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847912512] [2022-12-13 07:45:27,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:27,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:45:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:45:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:45:27,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:45:27,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 107 transitions, 1736 flow. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:27,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:27,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:45:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:28,440 INFO L130 PetriNetUnfolder]: 682/997 cut-off events. [2022-12-13 07:45:28,440 INFO L131 PetriNetUnfolder]: For 3562/3562 co-relation queries the response was YES. [2022-12-13 07:45:28,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 997 events. 682/997 cut-off events. For 3562/3562 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3388 event pairs, 32 based on Foata normal form. 1/797 useless extension candidates. Maximal degree in co-relation 7589. Up to 894 conditions per place. [2022-12-13 07:45:28,448 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 141 selfloop transitions, 45 changer transitions 1/187 dead transitions. [2022-12-13 07:45:28,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 187 transitions, 3355 flow [2022-12-13 07:45:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:45:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:45:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2022-12-13 07:45:28,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 07:45:28,449 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2022-12-13 07:45:28,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 187 transitions, 3355 flow [2022-12-13 07:45:28,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 186 transitions, 3334 flow [2022-12-13 07:45:28,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:28,462 INFO L89 Accepts]: Start accepts. Operand has 59 places, 186 transitions, 3334 flow [2022-12-13 07:45:28,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:28,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:28,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 186 transitions, 3334 flow [2022-12-13 07:45:28,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 186 transitions, 3334 flow [2022-12-13 07:45:28,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:28,466 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:28,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:45:28,467 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 186 transitions, 3334 flow [2022-12-13 07:45:28,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:28,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:28,467 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 07:45:28,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:45:28,673 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,SelfDestructingSolverStorable7 [2022-12-13 07:45:28,674 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 07:45:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1286057213, now seen corresponding path program 2 times [2022-12-13 07:45:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:28,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323443814] [2022-12-13 07:45:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:29,468 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 07:45:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323443814] [2022-12-13 07:45:29,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323443814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544899472] [2022-12-13 07:45:29,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:45:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:29,479 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 07:45:29,481 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 07:45:29,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:45:29,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:45:29,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 07:45:29,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:29,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:29,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 23 [2022-12-13 07:45:29,846 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 07:45:29,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:29,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:29,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 19 [2022-12-13 07:45:29,988 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:29,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:30,036 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 07:45:30,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544899472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:30,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:30,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 16 [2022-12-13 07:45:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073775746] [2022-12-13 07:45:30,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:30,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:45:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:45:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:45:30,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:45:30,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 186 transitions, 3334 flow. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:30,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:30,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:45:30,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:30,616 INFO L130 PetriNetUnfolder]: 848/1241 cut-off events. [2022-12-13 07:45:30,616 INFO L131 PetriNetUnfolder]: For 3814/3814 co-relation queries the response was YES. [2022-12-13 07:45:30,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11641 conditions, 1241 events. 848/1241 cut-off events. For 3814/3814 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4481 event pairs, 25 based on Foata normal form. 1/969 useless extension candidates. Maximal degree in co-relation 10711. Up to 1134 conditions per place. [2022-12-13 07:45:30,625 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 181 selfloop transitions, 48 changer transitions 1/230 dead transitions. [2022-12-13 07:45:30,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 230 transitions, 4606 flow [2022-12-13 07:45:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:45:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:45:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-12-13 07:45:30,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2022-12-13 07:45:30,627 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-13 07:45:30,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 230 transitions, 4606 flow [2022-12-13 07:45:30,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 229 transitions, 4583 flow [2022-12-13 07:45:30,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:30,677 INFO L89 Accepts]: Start accepts. Operand has 67 places, 229 transitions, 4583 flow [2022-12-13 07:45:30,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:30,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:30,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 229 transitions, 4583 flow [2022-12-13 07:45:30,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 229 transitions, 4583 flow [2022-12-13 07:45:30,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:30,684 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:30,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:45:30,685 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 229 transitions, 4583 flow [2022-12-13 07:45:30,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:30,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:30,685 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 07:45:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:45:30,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:30,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2051519649, now seen corresponding path program 3 times [2022-12-13 07:45:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:30,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524905900] [2022-12-13 07:45:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:31,909 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 07:45:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:31,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524905900] [2022-12-13 07:45:31,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524905900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:31,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346714138] [2022-12-13 07:45:31,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:45:31,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:31,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:31,910 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 07:45:31,912 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 07:45:32,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:45:32,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:45:32,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 07:45:32,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:32,100 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 07:45:32,148 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:45:32,148 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 07:45:32,477 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-13 07:45:32,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-12-13 07:45:32,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:32,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2022-12-13 07:45:32,655 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 07:45:32,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:33,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:33,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 42 [2022-12-13 07:45:33,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:33,370 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:33,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:33,536 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 07:45:33,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346714138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:33,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:33,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:45:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900232535] [2022-12-13 07:45:33,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:33,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:45:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:45:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-12-13 07:45:33,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 07:45:33,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 229 transitions, 4583 flow. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 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 07:45:33,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:33,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 07:45:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:34,365 INFO L130 PetriNetUnfolder]: 979/1431 cut-off events. [2022-12-13 07:45:34,365 INFO L131 PetriNetUnfolder]: For 4497/4497 co-relation queries the response was YES. [2022-12-13 07:45:34,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14954 conditions, 1431 events. 979/1431 cut-off events. For 4497/4497 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5354 event pairs, 25 based on Foata normal form. 1/1108 useless extension candidates. Maximal degree in co-relation 13818. Up to 1317 conditions per place. [2022-12-13 07:45:34,375 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 215 selfloop transitions, 56 changer transitions 1/272 dead transitions. [2022-12-13 07:45:34,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 272 transitions, 5998 flow [2022-12-13 07:45:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:45:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:45:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-13 07:45:34,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29464285714285715 [2022-12-13 07:45:34,377 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 07:45:34,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 272 transitions, 5998 flow [2022-12-13 07:45:34,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 271 transitions, 5973 flow [2022-12-13 07:45:34,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:34,398 INFO L89 Accepts]: Start accepts. Operand has 78 places, 271 transitions, 5973 flow [2022-12-13 07:45:34,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:34,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:34,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 271 transitions, 5973 flow [2022-12-13 07:45:34,405 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 271 transitions, 5973 flow [2022-12-13 07:45:34,405 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:36,823 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:45:36,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2427 [2022-12-13 07:45:36,824 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 270 transitions, 5951 flow [2022-12-13 07:45:36,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 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 07:45:36,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:36,824 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] [2022-12-13 07:45:36,841 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 07:45:37,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:37,025 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash 401841120, now seen corresponding path program 1 times [2022-12-13 07:45:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:37,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527585134] [2022-12-13 07:45:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:45:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527585134] [2022-12-13 07:45:38,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527585134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179284374] [2022-12-13 07:45:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:38,231 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 07:45:38,262 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 07:45:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:38,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 07:45:38,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:38,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:38,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 23 [2022-12-13 07:45:38,640 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 07:45:38,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:38,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:38,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 19 [2022-12-13 07:45:38,802 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:38,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:38,862 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 07:45:38,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179284374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:38,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:38,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 20 [2022-12-13 07:45:38,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897356425] [2022-12-13 07:45:38,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:38,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:45:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:45:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:45:38,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 07:45:38,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 270 transitions, 5951 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:38,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:38,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 07:45:38,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:39,733 INFO L130 PetriNetUnfolder]: 1131/1657 cut-off events. [2022-12-13 07:45:39,733 INFO L131 PetriNetUnfolder]: For 5496/5496 co-relation queries the response was YES. [2022-12-13 07:45:39,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18951 conditions, 1657 events. 1131/1657 cut-off events. For 5496/5496 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6355 event pairs, 45 based on Foata normal form. 1/1288 useless extension candidates. Maximal degree in co-relation 16592. Up to 1516 conditions per place. [2022-12-13 07:45:39,745 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 266 selfloop transitions, 69 changer transitions 1/336 dead transitions. [2022-12-13 07:45:39,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 336 transitions, 8061 flow [2022-12-13 07:45:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:45:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:45:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 128 transitions. [2022-12-13 07:45:39,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31527093596059114 [2022-12-13 07:45:39,748 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 07:45:39,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 336 transitions, 8061 flow [2022-12-13 07:45:39,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 335 transitions, 8034 flow [2022-12-13 07:45:39,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:39,775 INFO L89 Accepts]: Start accepts. Operand has 90 places, 335 transitions, 8034 flow [2022-12-13 07:45:39,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:39,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:39,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 335 transitions, 8034 flow [2022-12-13 07:45:39,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 335 transitions, 8034 flow [2022-12-13 07:45:39,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:41,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:45:41,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1930 [2022-12-13 07:45:41,705 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 334 transitions, 8010 flow [2022-12-13 07:45:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:41,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:41,705 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] [2022-12-13 07:45:41,725 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 07:45:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 07:45:41,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -603239557, now seen corresponding path program 1 times [2022-12-13 07:45:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482101778] [2022-12-13 07:45:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:43,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482101778] [2022-12-13 07:45:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482101778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:43,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442815200] [2022-12-13 07:45:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:43,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:45:43,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:45:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:43,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-13 07:45:43,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:43,241 INFO L321 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-12-13 07:45:43,241 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 4 case distinctions, treesize of input 18 treesize of output 60 [2022-12-13 07:45:43,277 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:45:43,278 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 07:45:43,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:43,517 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-13 07:45:43,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2022-12-13 07:45:43,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:43,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:43,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 106 [2022-12-13 07:45:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:43,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:46,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:46,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 42 [2022-12-13 07:45:46,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:46,204 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:46,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:46,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442815200] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:46,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:46,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-12-13 07:45:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546345043] [2022-12-13 07:45:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:46,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:45:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:46,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:45:46,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:45:46,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 07:45:46,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 334 transitions, 8010 flow. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 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 07:45:46,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:46,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 07:45:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:47,482 INFO L130 PetriNetUnfolder]: 1337/1958 cut-off events. [2022-12-13 07:45:47,482 INFO L131 PetriNetUnfolder]: For 6653/6653 co-relation queries the response was YES. [2022-12-13 07:45:47,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24318 conditions, 1958 events. 1337/1958 cut-off events. For 6653/6653 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7752 event pairs, 49 based on Foata normal form. 1/1523 useless extension candidates. Maximal degree in co-relation 20590. Up to 1795 conditions per place. [2022-12-13 07:45:47,496 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 315 selfloop transitions, 97 changer transitions 1/413 dead transitions. [2022-12-13 07:45:47,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 413 transitions, 10711 flow [2022-12-13 07:45:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:45:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:45:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-12-13 07:45:47,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29195402298850576 [2022-12-13 07:45:47,498 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2022-12-13 07:45:47,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 413 transitions, 10711 flow [2022-12-13 07:45:47,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 412 transitions, 10682 flow [2022-12-13 07:45:47,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:47,521 INFO L89 Accepts]: Start accepts. Operand has 103 places, 412 transitions, 10682 flow [2022-12-13 07:45:47,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:47,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:47,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 412 transitions, 10682 flow [2022-12-13 07:45:47,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 412 transitions, 10682 flow [2022-12-13 07:45:47,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:50,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:45:50,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2852 [2022-12-13 07:45:50,373 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 411 transitions, 10656 flow [2022-12-13 07:45:50,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 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 07:45:50,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:50,373 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] [2022-12-13 07:45:50,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:45:50,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:50,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1443343889, now seen corresponding path program 1 times [2022-12-13 07:45:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:50,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958761290] [2022-12-13 07:45:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958761290] [2022-12-13 07:45:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958761290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404335551] [2022-12-13 07:45:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:51,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:51,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:51,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:45:51,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:45:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:51,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 07:45:51,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:51,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:51,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 23 [2022-12-13 07:45:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:51,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:51,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:51,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 19 [2022-12-13 07:45:51,504 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:51,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 13 [2022-12-13 07:45:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:51,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404335551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:51,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:51,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 07:45:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390190763] [2022-12-13 07:45:51,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:51,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:45:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:51,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:45:51,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:45:51,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 07:45:51,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 411 transitions, 10656 flow. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 07:45:51,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:51,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 07:45:51,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:52,319 INFO L130 PetriNetUnfolder]: 1562/2282 cut-off events. [2022-12-13 07:45:52,319 INFO L131 PetriNetUnfolder]: For 6819/6819 co-relation queries the response was YES. [2022-12-13 07:45:52,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30807 conditions, 2282 events. 1562/2282 cut-off events. For 6819/6819 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9467 event pairs, 67 based on Foata normal form. 1/1768 useless extension candidates. Maximal degree in co-relation 23924. Up to 2124 conditions per place. [2022-12-13 07:45:52,400 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 374 selfloop transitions, 100 changer transitions 1/475 dead transitions. [2022-12-13 07:45:52,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 475 transitions, 13322 flow [2022-12-13 07:45:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:45:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:45:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 159 transitions. [2022-12-13 07:45:52,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2022-12-13 07:45:52,402 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2022-12-13 07:45:52,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 475 transitions, 13322 flow [2022-12-13 07:45:52,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 474 transitions, 13291 flow [2022-12-13 07:45:52,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:52,429 INFO L89 Accepts]: Start accepts. Operand has 115 places, 474 transitions, 13291 flow [2022-12-13 07:45:52,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:52,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:52,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 474 transitions, 13291 flow [2022-12-13 07:45:52,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 474 transitions, 13291 flow [2022-12-13 07:45:52,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:52,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:52,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:45:52,443 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 474 transitions, 13291 flow [2022-12-13 07:45:52,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 07:45:52,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:52,443 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] [2022-12-13 07:45:52,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:45:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:52,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -481305193, now seen corresponding path program 2 times [2022-12-13 07:45:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023227742] [2022-12-13 07:45:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023227742] [2022-12-13 07:45:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023227742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600813794] [2022-12-13 07:45:53,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:45:53,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:53,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:53,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:45:53,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:45:53,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:45:53,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:45:53,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 07:45:53,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:53,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:45:53,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 07:45:53,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:53,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2022-12-13 07:45:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:53,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:45:54,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset))) (and (forall ((v_ArrVal_754 (Array Int Int)) (~B~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_754))) (let ((.cse0 (select .cse2 ~B~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select .cse0 .cse1)) (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~csum~0 (select .cse0 c_~B~0.offset)))))) (forall ((v_ArrVal_754 (Array Int Int)) (~B~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_754))) (let ((.cse4 (select .cse3 ~B~0.base))) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~csum~0 (select .cse4 c_~B~0.offset)) (+ c_~asum~0 c_~bsum~0 (select .cse4 .cse1)))))))) is different from false [2022-12-13 07:45:54,054 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~asum~0 c_~bsum~0))) (and (forall ((v_ArrVal_754 (Array Int Int))) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_754) c_~A~0.base) c_~A~0.offset) c_~csum~0))) (forall ((v_ArrVal_754 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_754) c_~A~0.base) c_~A~0.offset) c_~csum~0) .cse0)))) is different from false [2022-12-13 07:45:54,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:45:54,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 38 [2022-12-13 07:45:54,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 07:45:54,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:45:54,086 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 07:45:54,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-13 07:45:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-13 07:45:54,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600813794] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:45:54,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:45:54,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-13 07:45:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342692522] [2022-12-13 07:45:54,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:45:54,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:45:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:45:54,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:45:54,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=428, Unknown=2, NotChecked=86, Total=600 [2022-12-13 07:45:54,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 07:45:54,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 474 transitions, 13291 flow. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:54,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:45:54,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 07:45:54,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:45:55,449 INFO L130 PetriNetUnfolder]: 2048/2990 cut-off events. [2022-12-13 07:45:55,450 INFO L131 PetriNetUnfolder]: For 9270/9270 co-relation queries the response was YES. [2022-12-13 07:45:55,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43401 conditions, 2990 events. 2048/2990 cut-off events. For 9270/9270 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13154 event pairs, 39 based on Foata normal form. 1/2304 useless extension candidates. Maximal degree in co-relation 30090. Up to 2794 conditions per place. [2022-12-13 07:45:55,470 INFO L137 encePairwiseOnDemand]: 13/29 looper letters, 510 selfloop transitions, 123 changer transitions 1/634 dead transitions. [2022-12-13 07:45:55,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 634 transitions, 19071 flow [2022-12-13 07:45:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:45:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:45:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2022-12-13 07:45:55,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 07:45:55,473 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2022-12-13 07:45:55,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 634 transitions, 19071 flow [2022-12-13 07:45:55,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 633 transitions, 19038 flow [2022-12-13 07:45:55,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:45:55,509 INFO L89 Accepts]: Start accepts. Operand has 125 places, 633 transitions, 19038 flow [2022-12-13 07:45:55,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:45:55,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:45:55,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 633 transitions, 19038 flow [2022-12-13 07:45:55,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 633 transitions, 19038 flow [2022-12-13 07:45:55,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:45:55,527 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:45:55,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 07:45:55,528 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 633 transitions, 19038 flow [2022-12-13 07:45:55,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:45:55,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:45:55,528 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] [2022-12-13 07:45:55,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:45:55,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 07:45:55,733 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:45:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:45:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2078878799, now seen corresponding path program 3 times [2022-12-13 07:45:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:45:55,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540434461] [2022-12-13 07:45:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:45:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:45:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:45:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:45:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:45:57,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540434461] [2022-12-13 07:45:57,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540434461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:45:57,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370096136] [2022-12-13 07:45:57,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:45:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:45:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:45:57,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:45:57,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:45:57,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:45:57,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:45:57,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-13 07:45:57,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:45:57,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428022 treesize of output 425974 [2022-12-13 07:46:13,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:46:13,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 07:46:13,494 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-13 07:46:13,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-12-13 07:46:13,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:46:13,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2022-12-13 07:46:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:46:13,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:46:14,161 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int) (v_ArrVal_848 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_848))) (let ((.cse1 (select (select .cse0 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) ~C~0.offset (+ .cse1 .cse2))) c_~B~0.base) c_~B~0.offset)) (+ .cse1 .cse2 c_~csum~0))))) (forall ((~C~0.offset Int) (v_ArrVal_848 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_848))) (let ((.cse3 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (<= (+ .cse3 .cse4 c_~csum~0) (+ c_~asum~0 c_~bsum~0 (select (select (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) ~C~0.offset (+ .cse3 .cse4))) c_~B~0.base) c_~B~0.offset))))))) is different from false [2022-12-13 07:46:14,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:46:14,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2582 treesize of output 2254 [2022-12-13 07:46:14,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:46:14,247 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 2390 treesize of output 2238 Received shutdown request... [2022-12-13 07:59:07,596 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 07:59:07,597 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:59:07,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:59:07,630 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:59:07,631 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 07:59:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:59:07,803 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. [2022-12-13 07:59:07,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:59:07,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:59:07,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:59:07,805 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:07,807 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:59:07,807 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:59:07,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:59:07 BasicIcfg [2022-12-13 07:59:07,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:59:07,808 INFO L158 Benchmark]: Toolchain (without parser) took 838248.14ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 166.3MB in the beginning and 887.6MB in the end (delta: -721.3MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.35ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 154.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.83ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 151.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: Boogie Preprocessor took 54.85ms. Allocated memory is still 190.8MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: RCFGBuilder took 589.60ms. Allocated memory is still 190.8MB. Free memory was 149.5MB in the beginning and 125.4MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 07:59:07,809 INFO L158 Benchmark]: TraceAbstraction took 837365.12ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 123.9MB in the beginning and 887.6MB in the end (delta: -763.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-13 07:59:07,810 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 190.8MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.35ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 154.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.83ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 151.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.85ms. Allocated memory is still 190.8MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.60ms. Allocated memory is still 190.8MB. Free memory was 149.5MB in the beginning and 125.4MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 837365.12ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 123.9MB in the beginning and 887.6MB in the end (delta: -763.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 285 PlacesBefore, 32 PlacesAfterwards, 304 TransitionsBefore, 28 TransitionsAfterwards, 12810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 136 TrivialYvCompositions, 117 ConcurrentYvCompositions, 23 ChoiceCompositions, 276 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 7778, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7151, independent: 7138, independent conditional: 0, independent unconditional: 7138, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7151, independent: 7133, independent conditional: 0, independent unconditional: 7133, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7793, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7151, unknown conditional: 0, unknown unconditional: 7151] , Statistics on independence cache: Total cache size (in pairs): 14092, Positive cache size: 14079, Positive conditional cache size: 0, Positive unconditional cache size: 14079, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 44 PlacesBefore, 43 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 229 TransitionsBefore, 229 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 78 PlacesBefore, 77 PlacesAfterwards, 271 TransitionsBefore, 270 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 90 PlacesBefore, 89 PlacesAfterwards, 335 TransitionsBefore, 334 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 103 PlacesBefore, 102 PlacesAfterwards, 412 TransitionsBefore, 411 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 474 TransitionsBefore, 474 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 125 PlacesBefore, 125 PlacesAfterwards, 633 TransitionsBefore, 633 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - TimeoutResultAtElement [Line: 83]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - TimeoutResultAtElement [Line: 84]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - TimeoutResultAtElement [Line: 85]: 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 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 406 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: 837.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6123 IncrementalHoareTripleChecker+Invalid, 6430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 65 mSDtfsCounter, 6123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 308 SyntacticMatches, 23 SemanticMatches, 207 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19038occurred in iteration=14, InterpolantAutomatonStates: 117, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 554 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 730 ConstructedInterpolants, 35 QuantifiedInterpolants, 13586 SizeOfPredicates, 191 NumberOfNonLiveVariables, 2804 ConjunctsInSsa, 555 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 51/118 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