/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 05:09:47,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 05:09:47,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 05:09:48,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 05:09:48,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 05:09:48,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 05:09:48,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 05:09:48,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 05:09:48,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 05:09:48,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 05:09:48,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 05:09:48,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 05:09:48,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 05:09:48,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 05:09:48,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 05:09:48,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 05:09:48,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 05:09:48,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 05:09:48,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 05:09:48,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 05:09:48,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 05:09:48,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 05:09:48,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 05:09:48,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 05:09:48,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 05:09:48,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 05:09:48,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 05:09:48,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 05:09:48,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 05:09:48,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 05:09:48,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 05:09:48,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 05:09:48,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 05:09:48,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 05:09:48,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 05:09:48,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 05:09:48,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 05:09:48,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 05:09:48,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 05:09:48,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 05:09:48,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 05:09:48,042 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-VariableLbe.epf [2023-01-28 05:09:48,061 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 05:09:48,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 05:09:48,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 05:09:48,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 05:09:48,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 05:09:48,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 05:09:48,062 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 05:09:48,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 05:09:48,062 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 05:09:48,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 05:09:48,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 05:09:48,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:09:48,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 05:09:48,064 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 05:09:48,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 05:09:48,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 05:09:48,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 05:09:48,263 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 05:09:48,263 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 05:09:48,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-01-28 05:09:49,301 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 05:09:49,461 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 05:09:49,461 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-01-28 05:09:49,466 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa92aa5c1/3289391f21f04af78d180546b6ad880f/FLAG28ade0382 [2023-01-28 05:09:49,479 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa92aa5c1/3289391f21f04af78d180546b6ad880f [2023-01-28 05:09:49,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 05:09:49,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 05:09:49,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 05:09:49,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 05:09:49,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 05:09:49,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17346cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49, skipping insertion in model container [2023-01-28 05:09:49,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 05:09:49,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 05:09:49,657 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2023-01-28 05:09:49,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:09:49,672 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 05:09:49,694 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2023-01-28 05:09:49,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:09:49,702 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:09:49,702 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:09:49,706 INFO L208 MainTranslator]: Completed translation [2023-01-28 05:09:49,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49 WrapperNode [2023-01-28 05:09:49,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 05:09:49,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 05:09:49,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 05:09:49,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 05:09:49,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,733 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 170 [2023-01-28 05:09:49,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 05:09:49,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 05:09:49,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 05:09:49,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 05:09:49,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 05:09:49,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 05:09:49,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 05:09:49,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 05:09:49,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (1/1) ... [2023-01-28 05:09:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:09:49,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:09:49,798 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) [2023-01-28 05:09:49,811 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 [2023-01-28 05:09:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 05:09:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 05:09:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 05:09:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 05:09:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 05:09:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 05:09:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 05:09:49,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 05:09:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 05:09:49,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 05:09:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 05:09:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 05:09:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 05:09:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 05:09:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 05:09:49,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 05:09:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 05:09:49,829 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 05:09:49,955 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 05:09:49,967 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 05:09:50,143 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 05:09:50,213 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 05:09:50,213 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 05:09:50,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:09:50 BoogieIcfgContainer [2023-01-28 05:09:50,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 05:09:50,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 05:09:50,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 05:09:50,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 05:09:50,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 05:09:49" (1/3) ... [2023-01-28 05:09:50,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:09:50, skipping insertion in model container [2023-01-28 05:09:50,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:09:49" (2/3) ... [2023-01-28 05:09:50,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:09:50, skipping insertion in model container [2023-01-28 05:09:50,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:09:50" (3/3) ... [2023-01-28 05:09:50,220 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2023-01-28 05:09:50,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 05:09:50,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 05:09:50,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 05:09:50,290 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 05:09:50,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 148 transitions, 320 flow [2023-01-28 05:09:50,389 INFO L130 PetriNetUnfolder]: 11/145 cut-off events. [2023-01-28 05:09:50,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:09:50,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 11/145 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 116. Up to 3 conditions per place. [2023-01-28 05:09:50,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 148 transitions, 320 flow [2023-01-28 05:09:50,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 135 transitions, 288 flow [2023-01-28 05:09:50,401 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 05:09:50,411 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 135 transitions, 288 flow [2023-01-28 05:09:50,414 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 135 transitions, 288 flow [2023-01-28 05:09:50,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 135 transitions, 288 flow [2023-01-28 05:09:50,452 INFO L130 PetriNetUnfolder]: 11/135 cut-off events. [2023-01-28 05:09:50,452 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:09:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 11/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 116. Up to 3 conditions per place. [2023-01-28 05:09:50,455 INFO L119 LiptonReduction]: Number of co-enabled transitions 1082 [2023-01-28 05:09:54,324 INFO L134 LiptonReduction]: Checked pairs total: 2030 [2023-01-28 05:09:54,325 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-01-28 05:09:54,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 05:09:54,351 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=PETRI_NET, 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;@6bb39198, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 05:09:54,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 05:09:54,384 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2023-01-28 05:09:54,385 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:09:54,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:09:54,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:09:54,389 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)] === [2023-01-28 05:09:54,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:09:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1050761945, now seen corresponding path program 1 times [2023-01-28 05:09:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:09:54,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320998489] [2023-01-28 05:09:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:09:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:09:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:09:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320998489] [2023-01-28 05:09:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320998489] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:09:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:09:54,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:09:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200386496] [2023-01-28 05:09:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:09:54,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:09:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:09:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:09:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:09:54,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-01-28 05:09:54,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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) [2023-01-28 05:09:54,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:09:54,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-01-28 05:09:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:09:54,829 INFO L130 PetriNetUnfolder]: 238/394 cut-off events. [2023-01-28 05:09:54,829 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-01-28 05:09:54,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 394 events. 238/394 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1530 event pairs, 14 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 687. Up to 129 conditions per place. [2023-01-28 05:09:54,832 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-01-28 05:09:54,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 230 flow [2023-01-28 05:09:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 05:09:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 05:09:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-01-28 05:09:54,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4706713780918728 [2023-01-28 05:09:54,844 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-01-28 05:09:54,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-01-28 05:09:54,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:09:54,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-01-28 05:09:54,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 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) [2023-01-28 05:09:54,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 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) [2023-01-28 05:09:54,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 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) [2023-01-28 05:09:54,862 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 5 states and 666 transitions. [2023-01-28 05:09:54,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 230 flow [2023-01-28 05:09:54,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-28 05:09:54,865 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 84 flow [2023-01-28 05:09:54,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-01-28 05:09:54,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-28 05:09:54,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 84 flow [2023-01-28 05:09:54,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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) [2023-01-28 05:09:54,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:09:54,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:09:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 05:09:54,871 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)] === [2023-01-28 05:09:54,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:09:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 982828987, now seen corresponding path program 2 times [2023-01-28 05:09:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:09:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606252528] [2023-01-28 05:09:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:09:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:09:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:09:55,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606252528] [2023-01-28 05:09:55,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606252528] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:09:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:09:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 05:09:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222621596] [2023-01-28 05:09:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:09:55,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 05:09:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:09:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 05:09:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 05:09:55,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 283 [2023-01-28 05:09:55,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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) [2023-01-28 05:09:55,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:09:55,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 283 [2023-01-28 05:09:55,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:09:55,428 INFO L130 PetriNetUnfolder]: 474/756 cut-off events. [2023-01-28 05:09:55,428 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2023-01-28 05:09:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 756 events. 474/756 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2877 event pairs, 37 based on Foata normal form. 20/717 useless extension candidates. Maximal degree in co-relation 658. Up to 278 conditions per place. [2023-01-28 05:09:55,433 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 59 selfloop transitions, 6 changer transitions 4/69 dead transitions. [2023-01-28 05:09:55,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 318 flow [2023-01-28 05:09:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 05:09:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 05:09:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-01-28 05:09:55,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482584553255931 [2023-01-28 05:09:55,435 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-01-28 05:09:55,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-01-28 05:09:55,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:09:55,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-01-28 05:09:55,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 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) [2023-01-28 05:09:55,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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) [2023-01-28 05:09:55,440 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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) [2023-01-28 05:09:55,440 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 84 flow. Second operand 7 states and 888 transitions. [2023-01-28 05:09:55,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 318 flow [2023-01-28 05:09:55,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:09:55,443 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 98 flow [2023-01-28 05:09:55,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 05:09:55,444 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-01-28 05:09:55,444 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 98 flow [2023-01-28 05:09:55,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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) [2023-01-28 05:09:55,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:09:55,444 INFO L208 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] [2023-01-28 05:09:55,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 05:09:55,445 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)] === [2023-01-28 05:09:55,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:09:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 165954322, now seen corresponding path program 1 times [2023-01-28 05:09:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:09:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591501424] [2023-01-28 05:09:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:09:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:09:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:09:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591501424] [2023-01-28 05:09:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591501424] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:09:55,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:09:55,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 05:09:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421060611] [2023-01-28 05:09:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:09:55,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 05:09:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:09:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 05:09:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 05:09:55,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-01-28 05:09:55,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-01-28 05:09:55,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:09:55,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-01-28 05:09:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:09:55,637 INFO L130 PetriNetUnfolder]: 205/384 cut-off events. [2023-01-28 05:09:55,637 INFO L131 PetriNetUnfolder]: For 483/483 co-relation queries the response was YES. [2023-01-28 05:09:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 384 events. 205/384 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1426 event pairs, 87 based on Foata normal form. 14/354 useless extension candidates. Maximal degree in co-relation 662. Up to 264 conditions per place. [2023-01-28 05:09:55,639 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 28 selfloop transitions, 2 changer transitions 3/38 dead transitions. [2023-01-28 05:09:55,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 196 flow [2023-01-28 05:09:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 05:09:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 05:09:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-01-28 05:09:55,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817432273262662 [2023-01-28 05:09:55,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-01-28 05:09:55,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-01-28 05:09:55,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:09:55,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-01-28 05:09:55,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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) [2023-01-28 05:09:55,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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) [2023-01-28 05:09:55,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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) [2023-01-28 05:09:55,642 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 98 flow. Second operand 3 states and 409 transitions. [2023-01-28 05:09:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 196 flow [2023-01-28 05:09:55,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 174 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-01-28 05:09:55,645 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 92 flow [2023-01-28 05:09:55,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-01-28 05:09:55,646 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-28 05:09:55,648 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 92 flow [2023-01-28 05:09:55,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-01-28 05:09:55,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:09:55,649 INFO L208 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] [2023-01-28 05:09:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 05:09:55,649 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)] === [2023-01-28 05:09:55,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:09:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1306821357, now seen corresponding path program 1 times [2023-01-28 05:09:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:09:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199564001] [2023-01-28 05:09:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:09:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:09:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:09:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199564001] [2023-01-28 05:09:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199564001] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:09:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:09:55,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:09:55,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881651169] [2023-01-28 05:09:55,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:09:55,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:09:55,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:09:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:09:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:09:55,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-01-28 05:09:55,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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) [2023-01-28 05:09:55,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:09:55,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-01-28 05:09:55,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:09:55,814 INFO L130 PetriNetUnfolder]: 234/450 cut-off events. [2023-01-28 05:09:55,815 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2023-01-28 05:09:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 450 events. 234/450 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1779 event pairs, 187 based on Foata normal form. 10/402 useless extension candidates. Maximal degree in co-relation 746. Up to 330 conditions per place. [2023-01-28 05:09:55,816 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 22 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2023-01-28 05:09:55,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 197 flow [2023-01-28 05:09:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:09:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:09:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-01-28 05:09:55,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44876325088339225 [2023-01-28 05:09:55,821 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-01-28 05:09:55,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-01-28 05:09:55,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:09:55,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-01-28 05:09:55,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-01-28 05:09:55,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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) [2023-01-28 05:09:55,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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) [2023-01-28 05:09:55,825 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 92 flow. Second operand 4 states and 508 transitions. [2023-01-28 05:09:55,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 197 flow [2023-01-28 05:09:55,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:09:55,827 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 104 flow [2023-01-28 05:09:55,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-01-28 05:09:55,830 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-01-28 05:09:55,830 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 104 flow [2023-01-28 05:09:55,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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) [2023-01-28 05:09:55,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:09:55,831 INFO L208 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] [2023-01-28 05:09:55,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 05:09:55,831 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)] === [2023-01-28 05:09:55,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:09:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash -372538144, now seen corresponding path program 1 times [2023-01-28 05:09:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:09:55,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165589331] [2023-01-28 05:09:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:09:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:09:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:09:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165589331] [2023-01-28 05:09:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165589331] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:09:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852660372] [2023-01-28 05:09:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:09:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:09:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:09:56,655 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) [2023-01-28 05:09:56,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 05:09:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:09:56,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-28 05:09:56,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:09:56,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-01-28 05:09:56,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2023-01-28 05:09:57,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2023-01-28 05:09:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:09:57,218 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 18 treesize of output 20 [2023-01-28 05:09:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:09:57,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:09:57,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2023-01-28 05:09:57,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:09:57,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-01-28 05:09:57,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:09:57,766 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 484 treesize of output 460 [2023-01-28 05:09:57,786 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 152 treesize of output 128 [2023-01-28 05:09:57,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:09:57,799 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 126 treesize of output 122 [2023-01-28 05:09:57,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:09:57,811 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 125 treesize of output 109 [2023-01-28 05:09:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 05:09:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852660372] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:09:58,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:09:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2023-01-28 05:09:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588602131] [2023-01-28 05:09:58,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:09:58,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 05:09:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:09:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 05:09:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=979, Unknown=2, NotChecked=64, Total=1190 [2023-01-28 05:09:58,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 05:09:58,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 104 flow. Second operand has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 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) [2023-01-28 05:09:58,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:09:58,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 05:09:58,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:10:03,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:10:06,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:10:08,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:10:11,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:10:12,370 INFO L130 PetriNetUnfolder]: 1549/2684 cut-off events. [2023-01-28 05:10:12,370 INFO L131 PetriNetUnfolder]: For 1530/1530 co-relation queries the response was YES. [2023-01-28 05:10:12,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7122 conditions, 2684 events. 1549/2684 cut-off events. For 1530/1530 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14927 event pairs, 40 based on Foata normal form. 49/2504 useless extension candidates. Maximal degree in co-relation 7105. Up to 529 conditions per place. [2023-01-28 05:10:12,381 INFO L137 encePairwiseOnDemand]: 266/283 looper letters, 292 selfloop transitions, 159 changer transitions 83/534 dead transitions. [2023-01-28 05:10:12,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 534 transitions, 2659 flow [2023-01-28 05:10:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-01-28 05:10:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-01-28 05:10:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 6147 transitions. [2023-01-28 05:10:12,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2784724109812449 [2023-01-28 05:10:12,393 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 6147 transitions. [2023-01-28 05:10:12,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 6147 transitions. [2023-01-28 05:10:12,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:10:12,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 6147 transitions. [2023-01-28 05:10:12,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 78.8076923076923) internal successors, (6147), 78 states have internal predecessors, (6147), 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) [2023-01-28 05:10:12,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 283.0) internal successors, (22357), 79 states have internal predecessors, (22357), 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) [2023-01-28 05:10:12,425 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 283.0) internal successors, (22357), 79 states have internal predecessors, (22357), 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) [2023-01-28 05:10:12,425 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 104 flow. Second operand 78 states and 6147 transitions. [2023-01-28 05:10:12,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 534 transitions, 2659 flow [2023-01-28 05:10:12,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 534 transitions, 2631 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 05:10:12,437 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1334 flow [2023-01-28 05:10:12,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1334, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2023-01-28 05:10:12,439 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2023-01-28 05:10:12,439 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1334 flow [2023-01-28 05:10:12,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 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) [2023-01-28 05:10:12,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:10:12,440 INFO L208 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] [2023-01-28 05:10:12,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 05:10:12,649 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 [2023-01-28 05:10:12,649 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)] === [2023-01-28 05:10:12,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:10:12,650 INFO L85 PathProgramCache]: Analyzing trace with hash -708902324, now seen corresponding path program 2 times [2023-01-28 05:10:12,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:10:12,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965308765] [2023-01-28 05:10:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:10:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:10:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:10:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:10:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965308765] [2023-01-28 05:10:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965308765] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:10:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184124116] [2023-01-28 05:10:13,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:10:13,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:10:13,469 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) [2023-01-28 05:10:13,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 05:10:13,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:10:13,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:10:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 05:10:13,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:10:13,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:10:13,733 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 18 treesize of output 20 [2023-01-28 05:10:13,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:10:13,774 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 18 treesize of output 20 [2023-01-28 05:10:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:10:13,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:10:14,049 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2023-01-28 05:10:14,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:14,068 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 190 treesize of output 174 [2023-01-28 05:10:14,091 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 35 treesize of output 29 [2023-01-28 05:10:14,096 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 36 treesize of output 24 [2023-01-28 05:10:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:10:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184124116] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:10:14,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:10:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-01-28 05:10:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994097231] [2023-01-28 05:10:14,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:10:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 05:10:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:10:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 05:10:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=875, Unknown=6, NotChecked=60, Total=1056 [2023-01-28 05:10:14,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 283 [2023-01-28 05:10:14,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 196 transitions, 1334 flow. Second operand has 33 states, 33 states have (on average 76.93939393939394) internal successors, (2539), 33 states have internal predecessors, (2539), 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) [2023-01-28 05:10:14,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:10:14,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 283 [2023-01-28 05:10:14,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:10:16,923 INFO L130 PetriNetUnfolder]: 1487/2632 cut-off events. [2023-01-28 05:10:16,923 INFO L131 PetriNetUnfolder]: For 56146/56146 co-relation queries the response was YES. [2023-01-28 05:10:16,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15081 conditions, 2632 events. 1487/2632 cut-off events. For 56146/56146 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14530 event pairs, 53 based on Foata normal form. 28/2659 useless extension candidates. Maximal degree in co-relation 14672. Up to 527 conditions per place. [2023-01-28 05:10:16,948 INFO L137 encePairwiseOnDemand]: 270/283 looper letters, 256 selfloop transitions, 167 changer transitions 43/466 dead transitions. [2023-01-28 05:10:16,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 466 transitions, 5197 flow [2023-01-28 05:10:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 05:10:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 05:10:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3107 transitions. [2023-01-28 05:10:16,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2889157522782221 [2023-01-28 05:10:16,955 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3107 transitions. [2023-01-28 05:10:16,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3107 transitions. [2023-01-28 05:10:16,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:10:16,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3107 transitions. [2023-01-28 05:10:16,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 81.76315789473684) internal successors, (3107), 38 states have internal predecessors, (3107), 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) [2023-01-28 05:10:16,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 283.0) internal successors, (11037), 39 states have internal predecessors, (11037), 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) [2023-01-28 05:10:16,970 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 283.0) internal successors, (11037), 39 states have internal predecessors, (11037), 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) [2023-01-28 05:10:16,970 INFO L175 Difference]: Start difference. First operand has 160 places, 196 transitions, 1334 flow. Second operand 38 states and 3107 transitions. [2023-01-28 05:10:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 466 transitions, 5197 flow [2023-01-28 05:10:17,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 466 transitions, 4849 flow, removed 128 selfloop flow, removed 10 redundant places. [2023-01-28 05:10:17,104 INFO L231 Difference]: Finished difference. Result has 191 places, 251 transitions, 2112 flow [2023-01-28 05:10:17,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2112, PETRI_PLACES=191, PETRI_TRANSITIONS=251} [2023-01-28 05:10:17,120 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2023-01-28 05:10:17,120 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 251 transitions, 2112 flow [2023-01-28 05:10:17,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 76.93939393939394) internal successors, (2539), 33 states have internal predecessors, (2539), 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) [2023-01-28 05:10:17,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:10:17,122 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:10:17,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 05:10:17,322 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,SelfDestructingSolverStorable5 [2023-01-28 05:10:17,323 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)] === [2023-01-28 05:10:17,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:10:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1109082783, now seen corresponding path program 3 times [2023-01-28 05:10:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:10:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210794386] [2023-01-28 05:10:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:10:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:10:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:10:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:10:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:10:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210794386] [2023-01-28 05:10:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210794386] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:10:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:10:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:10:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403678348] [2023-01-28 05:10:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:10:17,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:10:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:10:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:10:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:10:17,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-01-28 05:10:17,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 251 transitions, 2112 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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) [2023-01-28 05:10:17,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:10:17,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-01-28 05:10:17,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:10:17,965 INFO L130 PetriNetUnfolder]: 1820/3650 cut-off events. [2023-01-28 05:10:17,966 INFO L131 PetriNetUnfolder]: For 76418/76559 co-relation queries the response was YES. [2023-01-28 05:10:17,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22383 conditions, 3650 events. 1820/3650 cut-off events. For 76418/76559 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 24804 event pairs, 441 based on Foata normal form. 185/3738 useless extension candidates. Maximal degree in co-relation 21913. Up to 1312 conditions per place. [2023-01-28 05:10:18,011 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 239 selfloop transitions, 41 changer transitions 42/374 dead transitions. [2023-01-28 05:10:18,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 374 transitions, 3786 flow [2023-01-28 05:10:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:10:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:10:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-01-28 05:10:18,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035335689045937 [2023-01-28 05:10:18,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-01-28 05:10:18,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-01-28 05:10:18,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:10:18,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-01-28 05:10:18,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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) [2023-01-28 05:10:18,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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) [2023-01-28 05:10:18,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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) [2023-01-28 05:10:18,015 INFO L175 Difference]: Start difference. First operand has 191 places, 251 transitions, 2112 flow. Second operand 4 states and 570 transitions. [2023-01-28 05:10:18,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 374 transitions, 3786 flow [2023-01-28 05:10:18,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 374 transitions, 3455 flow, removed 64 selfloop flow, removed 14 redundant places. [2023-01-28 05:10:18,198 INFO L231 Difference]: Finished difference. Result has 182 places, 260 transitions, 2152 flow [2023-01-28 05:10:18,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2152, PETRI_PLACES=182, PETRI_TRANSITIONS=260} [2023-01-28 05:10:18,198 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2023-01-28 05:10:18,198 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 260 transitions, 2152 flow [2023-01-28 05:10:18,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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) [2023-01-28 05:10:18,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:10:18,199 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:10:18,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 05:10:18,199 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)] === [2023-01-28 05:10:18,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:10:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -582912098, now seen corresponding path program 4 times [2023-01-28 05:10:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:10:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891828908] [2023-01-28 05:10:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:10:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:10:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:10:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 05:10:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:10:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891828908] [2023-01-28 05:10:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891828908] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:10:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619329064] [2023-01-28 05:10:18,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 05:10:18,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:18,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:10:18,327 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) [2023-01-28 05:10:18,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 05:10:18,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 05:10:18,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:10:18,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 05:10:18,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:10:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 05:10:18,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:10:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 05:10:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619329064] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:10:18,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:10:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 05:10:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667810825] [2023-01-28 05:10:18,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:10:18,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 05:10:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:10:18,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 05:10:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-28 05:10:18,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 283 [2023-01-28 05:10:18,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 260 transitions, 2152 flow. Second operand has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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) [2023-01-28 05:10:18,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:10:18,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 283 [2023-01-28 05:10:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:10:18,902 INFO L130 PetriNetUnfolder]: 1227/2633 cut-off events. [2023-01-28 05:10:18,903 INFO L131 PetriNetUnfolder]: For 52368/52469 co-relation queries the response was YES. [2023-01-28 05:10:18,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15809 conditions, 2633 events. 1227/2633 cut-off events. For 52368/52469 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 17374 event pairs, 620 based on Foata normal form. 58/2621 useless extension candidates. Maximal degree in co-relation 15749. Up to 1973 conditions per place. [2023-01-28 05:10:18,928 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 140 selfloop transitions, 3 changer transitions 36/212 dead transitions. [2023-01-28 05:10:18,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 212 transitions, 2189 flow [2023-01-28 05:10:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 05:10:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 05:10:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-01-28 05:10:18,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369846878680801 [2023-01-28 05:10:18,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-01-28 05:10:18,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-01-28 05:10:18,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:10:18,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-01-28 05:10:18,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 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) [2023-01-28 05:10:18,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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) [2023-01-28 05:10:18,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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) [2023-01-28 05:10:18,942 INFO L175 Difference]: Start difference. First operand has 182 places, 260 transitions, 2152 flow. Second operand 6 states and 742 transitions. [2023-01-28 05:10:18,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 212 transitions, 2189 flow [2023-01-28 05:10:18,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 212 transitions, 2082 flow, removed 43 selfloop flow, removed 11 redundant places. [2023-01-28 05:10:18,989 INFO L231 Difference]: Finished difference. Result has 160 places, 176 transitions, 1456 flow [2023-01-28 05:10:18,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1456, PETRI_PLACES=160, PETRI_TRANSITIONS=176} [2023-01-28 05:10:18,991 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2023-01-28 05:10:18,991 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 1456 flow [2023-01-28 05:10:18,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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) [2023-01-28 05:10:18,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:10:18,992 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:10:18,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 05:10:19,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:19,198 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)] === [2023-01-28 05:10:19,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:10:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1913761, now seen corresponding path program 5 times [2023-01-28 05:10:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:10:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028837010] [2023-01-28 05:10:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:10:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:10:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:10:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:10:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028837010] [2023-01-28 05:10:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028837010] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:10:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859840094] [2023-01-28 05:10:20,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:10:20,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:20,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:10:20,433 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) [2023-01-28 05:10:20,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 05:10:20,525 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 05:10:20,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:10:20,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjunts are in the unsatisfiable core [2023-01-28 05:10:20,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:10:20,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-01-28 05:10:20,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2023-01-28 05:10:20,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:10:20,891 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 19 treesize of output 21 [2023-01-28 05:10:20,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:10:20,933 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 19 treesize of output 21 [2023-01-28 05:10:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:21,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:10:22,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:22,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 91 [2023-01-28 05:10:22,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:22,219 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 1636 treesize of output 1560 [2023-01-28 05:10:22,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:22,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 284 [2023-01-28 05:10:22,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:22,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 340 treesize of output 278 [2023-01-28 05:10:22,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:22,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 201 treesize of output 179 [2023-01-28 05:10:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859840094] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:10:24,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:10:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2023-01-28 05:10:24,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675068197] [2023-01-28 05:10:24,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:10:24,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-01-28 05:10:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:10:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-01-28 05:10:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2071, Unknown=10, NotChecked=0, Total=2352 [2023-01-28 05:10:24,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 05:10:24,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 176 transitions, 1456 flow. Second operand has 49 states, 49 states have (on average 73.63265306122449) internal successors, (3608), 49 states have internal predecessors, (3608), 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) [2023-01-28 05:10:24,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:10:24,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 05:10:24,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:10:37,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:10:49,121 INFO L130 PetriNetUnfolder]: 6922/12375 cut-off events. [2023-01-28 05:10:49,121 INFO L131 PetriNetUnfolder]: For 142678/142678 co-relation queries the response was YES. [2023-01-28 05:10:49,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67010 conditions, 12375 events. 6922/12375 cut-off events. For 142678/142678 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 91917 event pairs, 306 based on Foata normal form. 175/12550 useless extension candidates. Maximal degree in co-relation 66958. Up to 2406 conditions per place. [2023-01-28 05:10:49,202 INFO L137 encePairwiseOnDemand]: 267/283 looper letters, 683 selfloop transitions, 596 changer transitions 156/1435 dead transitions. [2023-01-28 05:10:49,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1435 transitions, 14480 flow [2023-01-28 05:10:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2023-01-28 05:10:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2023-01-28 05:10:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 10579 transitions. [2023-01-28 05:10:49,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27896735404250833 [2023-01-28 05:10:49,221 INFO L72 ComplementDD]: Start complementDD. Operand 134 states and 10579 transitions. [2023-01-28 05:10:49,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 10579 transitions. [2023-01-28 05:10:49,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:10:49,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 134 states and 10579 transitions. [2023-01-28 05:10:49,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 135 states, 134 states have (on average 78.94776119402985) internal successors, (10579), 134 states have internal predecessors, (10579), 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) [2023-01-28 05:10:49,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 135 states, 135 states have (on average 283.0) internal successors, (38205), 135 states have internal predecessors, (38205), 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) [2023-01-28 05:10:49,272 INFO L81 ComplementDD]: Finished complementDD. Result has 135 states, 135 states have (on average 283.0) internal successors, (38205), 135 states have internal predecessors, (38205), 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) [2023-01-28 05:10:49,273 INFO L175 Difference]: Start difference. First operand has 160 places, 176 transitions, 1456 flow. Second operand 134 states and 10579 transitions. [2023-01-28 05:10:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1435 transitions, 14480 flow [2023-01-28 05:10:49,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1435 transitions, 13948 flow, removed 263 selfloop flow, removed 12 redundant places. [2023-01-28 05:10:49,583 INFO L231 Difference]: Finished difference. Result has 320 places, 715 transitions, 8823 flow [2023-01-28 05:10:49,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=8823, PETRI_PLACES=320, PETRI_TRANSITIONS=715} [2023-01-28 05:10:49,584 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 288 predicate places. [2023-01-28 05:10:49,584 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 715 transitions, 8823 flow [2023-01-28 05:10:49,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 73.63265306122449) internal successors, (3608), 49 states have internal predecessors, (3608), 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) [2023-01-28 05:10:49,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:10:49,585 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:10:49,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-28 05:10:49,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:49,790 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)] === [2023-01-28 05:10:49,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:10:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash -574403061, now seen corresponding path program 6 times [2023-01-28 05:10:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:10:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528262852] [2023-01-28 05:10:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:10:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:10:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:10:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:10:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528262852] [2023-01-28 05:10:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528262852] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:10:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134580661] [2023-01-28 05:10:51,097 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:10:51,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:10:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:10:51,098 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) [2023-01-28 05:10:51,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 05:10:51,283 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 05:10:51,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:10:51,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 05:10:51,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:10:51,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:10:51,659 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 18 treesize of output 20 [2023-01-28 05:10:52,005 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-01-28 05:10:52,006 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 35 treesize of output 13 [2023-01-28 05:10:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:52,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:10:52,630 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:10:52,630 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 100 treesize of output 103 [2023-01-28 05:10:52,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:10:52,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 49 [2023-01-28 05:10:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:10:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134580661] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:10:53,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:10:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2023-01-28 05:10:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806619447] [2023-01-28 05:10:53,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:10:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-01-28 05:10:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:10:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-01-28 05:10:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2022, Unknown=3, NotChecked=0, Total=2256 [2023-01-28 05:10:53,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 05:10:53,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 715 transitions, 8823 flow. Second operand has 48 states, 48 states have (on average 73.70833333333333) internal successors, (3538), 48 states have internal predecessors, (3538), 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) [2023-01-28 05:10:53,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:10:53,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 05:10:53,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:11:03,261 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:11:25,313 WARN L222 SmtUtils]: Spent 18.23s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:11:32,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:11:35,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:11:37,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:11:51,707 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:11:53,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:11:56,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:12:21,294 WARN L222 SmtUtils]: Spent 24.53s on a formula simplification. DAG size of input: 87 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:12:37,992 WARN L222 SmtUtils]: Spent 12.29s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:12:48,724 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:12:53,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:12:55,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:13:08,417 WARN L222 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 75 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:13:14,728 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:13:28,271 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:13:34,483 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:13:36,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:13:40,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:13:50,275 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:13:55,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:14:04,202 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:14:12,540 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:14:14,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:14:24,255 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:14:26,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:14:28,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:14:31,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:14:42,379 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:15:05,147 WARN L222 SmtUtils]: Spent 22.48s on a formula simplification. DAG size of input: 89 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:15:28,688 WARN L222 SmtUtils]: Spent 20.52s on a formula simplification. DAG size of input: 96 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:15:41,985 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:15:54,946 WARN L222 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 70 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:16:14,218 WARN L222 SmtUtils]: Spent 18.35s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:16:24,590 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:16:33,311 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:16:50,097 WARN L222 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 67 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:16:56,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:16:58,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:01,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:06,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:09,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:19,559 WARN L222 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:17:21,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:34,417 WARN L222 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:17:36,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:39,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:41,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:17:43,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:18:00,976 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:18:03,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:18:17,803 WARN L222 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:18:24,411 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:18:42,832 WARN L222 SmtUtils]: Spent 18.29s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:18:44,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:18:47,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:18:49,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:19:20,693 WARN L222 SmtUtils]: Spent 24.34s on a formula simplification. DAG size of input: 90 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:19:27,265 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:19:35,531 WARN L222 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:19:52,207 WARN L222 SmtUtils]: Spent 16.38s on a formula simplification. DAG size of input: 93 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:20:18,941 WARN L222 SmtUtils]: Spent 18.21s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:20:22,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:20:29,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:20:38,652 WARN L222 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:20:55,021 WARN L222 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 83 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:21:03,335 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:21:05,039 INFO L130 PetriNetUnfolder]: 40607/71044 cut-off events. [2023-01-28 05:21:05,040 INFO L131 PetriNetUnfolder]: For 2740298/2740298 co-relation queries the response was YES. [2023-01-28 05:21:06,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530384 conditions, 71044 events. 40607/71044 cut-off events. For 2740298/2740298 co-relation queries the response was YES. Maximal size of possible extension queue 2270. Compared 643992 event pairs, 3295 based on Foata normal form. 1897/72941 useless extension candidates. Maximal degree in co-relation 530285. Up to 14972 conditions per place. [2023-01-28 05:21:06,857 INFO L137 encePairwiseOnDemand]: 267/283 looper letters, 2058 selfloop transitions, 3232 changer transitions 2144/7434 dead transitions. [2023-01-28 05:21:06,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 7434 transitions, 105771 flow [2023-01-28 05:21:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 317 states. [2023-01-28 05:21:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2023-01-28 05:21:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 25277 transitions. [2023-01-28 05:21:06,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28176031924736095 [2023-01-28 05:21:06,880 INFO L72 ComplementDD]: Start complementDD. Operand 317 states and 25277 transitions. [2023-01-28 05:21:06,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 25277 transitions. [2023-01-28 05:21:06,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:21:06,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 317 states and 25277 transitions. [2023-01-28 05:21:06,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 318 states, 317 states have (on average 79.73817034700315) internal successors, (25277), 317 states have internal predecessors, (25277), 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) [2023-01-28 05:21:06,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 318 states, 318 states have (on average 283.0) internal successors, (89994), 318 states have internal predecessors, (89994), 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) [2023-01-28 05:21:06,974 INFO L81 ComplementDD]: Finished complementDD. Result has 318 states, 318 states have (on average 283.0) internal successors, (89994), 318 states have internal predecessors, (89994), 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) [2023-01-28 05:21:06,974 INFO L175 Difference]: Start difference. First operand has 320 places, 715 transitions, 8823 flow. Second operand 317 states and 25277 transitions. [2023-01-28 05:21:06,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 7434 transitions, 105771 flow [2023-01-28 05:21:36,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 7434 transitions, 94679 flow, removed 3754 selfloop flow, removed 15 redundant places. [2023-01-28 05:21:36,824 INFO L231 Difference]: Finished difference. Result has 770 places, 3675 transitions, 63638 flow [2023-01-28 05:21:36,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=7181, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=496, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=317, PETRI_FLOW=63638, PETRI_PLACES=770, PETRI_TRANSITIONS=3675} [2023-01-28 05:21:36,825 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 738 predicate places. [2023-01-28 05:21:36,825 INFO L495 AbstractCegarLoop]: Abstraction has has 770 places, 3675 transitions, 63638 flow [2023-01-28 05:21:36,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 73.70833333333333) internal successors, (3538), 48 states have internal predecessors, (3538), 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) [2023-01-28 05:21:36,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:21:36,826 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:21:36,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 05:21:37,030 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,SelfDestructingSolverStorable9 [2023-01-28 05:21:37,030 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)] === [2023-01-28 05:21:37,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:21:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash -212149325, now seen corresponding path program 7 times [2023-01-28 05:21:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:21:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912987877] [2023-01-28 05:21:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:21:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:21:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:21:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:21:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:21:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912987877] [2023-01-28 05:21:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912987877] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:21:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309377779] [2023-01-28 05:21:38,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:21:38,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:21:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:21:38,419 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) [2023-01-28 05:21:38,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 05:21:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:21:38,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 05:21:38,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:21:38,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:21:38,761 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 18 treesize of output 20 [2023-01-28 05:21:39,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:21:39,013 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 30 treesize of output 30 [2023-01-28 05:21:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:21:39,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:21:39,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_393) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1))) is different from false [2023-01-28 05:21:39,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:21:39,575 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 296 treesize of output 265 [2023-01-28 05:21:39,584 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 95 treesize of output 81 [2023-01-28 05:21:39,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:21:39,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 67 [2023-01-28 05:21:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 05:21:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309377779] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:21:40,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:21:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 45 [2023-01-28 05:21:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891998706] [2023-01-28 05:21:40,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:21:40,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-01-28 05:21:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:21:40,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-01-28 05:21:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1814, Unknown=8, NotChecked=86, Total=2070 [2023-01-28 05:21:40,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 283 [2023-01-28 05:21:40,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 3675 transitions, 63638 flow. Second operand has 46 states, 46 states have (on average 73.67391304347827) internal successors, (3389), 46 states have internal predecessors, (3389), 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) [2023-01-28 05:21:40,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:21:40,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 283 [2023-01-28 05:21:40,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:07,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 05:22:20,937 WARN L222 SmtUtils]: Spent 10.32s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:22:47,494 WARN L222 SmtUtils]: Spent 26.48s on a formula simplification. DAG size of input: 93 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:23:05,909 WARN L222 SmtUtils]: Spent 18.30s on a formula simplification. DAG size of input: 49 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 05:23:40,526 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 [2023-01-28 05:23:40,526 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 05:23:41,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 05:23:41,727 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 05:23:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-01-28 05:23:41,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 05:23:41,753 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-28 05:23:41,756 INFO L158 Benchmark]: Toolchain (without parser) took 832271.34ms. Allocated memory was 373.3MB in the beginning and 2.9GB in the end (delta: 2.5GB). Free memory was 315.2MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-01-28 05:23:41,756 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 373.3MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 05:23:41,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.44ms. Allocated memory is still 373.3MB. Free memory was 315.2MB in the beginning and 303.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 05:23:41,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.33ms. Allocated memory is still 373.3MB. Free memory was 303.4MB in the beginning and 301.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:23:41,756 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 373.3MB. Free memory was 301.3MB in the beginning and 299.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:23:41,756 INFO L158 Benchmark]: RCFGBuilder took 444.98ms. Allocated memory was 373.3MB in the beginning and 616.6MB in the end (delta: 243.3MB). Free memory was 299.9MB in the beginning and 581.9MB in the end (delta: -282.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. [2023-01-28 05:23:41,757 INFO L158 Benchmark]: TraceAbstraction took 831538.79ms. Allocated memory was 616.6MB in the beginning and 2.9GB in the end (delta: 2.3GB). Free memory was 580.8MB in the beginning and 1.3GB in the end (delta: -740.7MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-01-28 05:23:41,757 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.08ms. Allocated memory is still 373.3MB. Free memory is still 320.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 220.44ms. Allocated memory is still 373.3MB. Free memory was 315.2MB in the beginning and 303.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.33ms. Allocated memory is still 373.3MB. Free memory was 303.4MB in the beginning and 301.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 373.3MB. Free memory was 301.3MB in the beginning and 299.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 444.98ms. Allocated memory was 373.3MB in the beginning and 616.6MB in the end (delta: 243.3MB). Free memory was 299.9MB in the beginning and 581.9MB in the end (delta: -282.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. * TraceAbstraction took 831538.79ms. Allocated memory was 616.6MB in the beginning and 2.9GB in the end (delta: 2.3GB). Free memory was 580.8MB in the beginning and 1.3GB in the end (delta: -740.7MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 134 PlacesBefore, 32 PlacesAfterwards, 135 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 135 TotalNumberOfCompositions, 2030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1324, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 612, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1324, independent: 656, independent conditional: 0, independent unconditional: 656, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 612, unknown conditional: 0, unknown unconditional: 612] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown [2023-01-28 05:23:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137