/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:42:56,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:42:56,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:42:56,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:42:56,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:42:56,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:42:56,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:42:56,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:42:56,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:42:56,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:42:56,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:42:56,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:42:56,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:42:56,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:42:56,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:42:56,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:42:56,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:42:56,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:42:56,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:42:56,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:42:56,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:42:56,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:42:56,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:42:56,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:42:56,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:42:56,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:42:56,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:42:56,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:42:56,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:42:56,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:42:56,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:42:56,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:42:56,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:42:56,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:42:56,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:42:56,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:42:56,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:42:56,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:42:56,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:42:56,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:42:56,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:42:56,979 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-27 22:42:56,999 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:42:56,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:42:56,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:42:57,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:42:57,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:42:57,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:42:57,000 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:42:57,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:42:57,000 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:42:57,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:42:57,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:42:57,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:42:57,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:42:57,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:42:57,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:42:57,003 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 [2023-01-27 22:42:57,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:42:57,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:42:57,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:42:57,219 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:42:57,221 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:42:57,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2023-01-27 22:42:58,198 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:42:58,349 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:42:58,349 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2023-01-27 22:42:58,354 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3860c57e3/90f6a074397d44cd941e4e5d6f980d80/FLAG5c63fc129 [2023-01-27 22:42:58,362 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3860c57e3/90f6a074397d44cd941e4e5d6f980d80 [2023-01-27 22:42:58,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:42:58,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:42:58,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:42:58,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:42:58,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:42:58,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f759a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58, skipping insertion in model container [2023-01-27 22:42:58,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:42:58,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:42:58,491 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-queue-add-3.wvr.c[3412,3425] [2023-01-27 22:42:58,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:42:58,505 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:42:58,521 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-queue-add-3.wvr.c[3412,3425] [2023-01-27 22:42:58,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:42:58,528 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:42:58,528 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:42:58,532 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:42:58,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58 WrapperNode [2023-01-27 22:42:58,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:42:58,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:42:58,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:42:58,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:42:58,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,559 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 252 [2023-01-27 22:42:58,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:42:58,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:42:58,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:42:58,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:42:58,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:42:58,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:42:58,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:42:58,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:42:58,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (1/1) ... [2023-01-27 22:42:58,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:42:58,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:58,610 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-27 22:42:58,618 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-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:42:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:42:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 22:42:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:42:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 22:42:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 22:42:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:42:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:42:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:42:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:42:58,637 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:42:58,719 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:42:58,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:42:59,011 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:42:59,147 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:42:59,148 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-27 22:42:59,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:42:59 BoogieIcfgContainer [2023-01-27 22:42:59,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:42:59,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:42:59,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:42:59,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:42:59,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:42:58" (1/3) ... [2023-01-27 22:42:59,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f38d696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:42:59, skipping insertion in model container [2023-01-27 22:42:59,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:58" (2/3) ... [2023-01-27 22:42:59,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f38d696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:42:59, skipping insertion in model container [2023-01-27 22:42:59,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:42:59" (3/3) ... [2023-01-27 22:42:59,162 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2023-01-27 22:42:59,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:42:59,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:42:59,173 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:42:59,222 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 22:42:59,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 201 transitions, 426 flow [2023-01-27 22:42:59,298 INFO L130 PetriNetUnfolder]: 18/198 cut-off events. [2023-01-27 22:42:59,298 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:42:59,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 18/198 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 116 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-01-27 22:42:59,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 201 transitions, 426 flow [2023-01-27 22:42:59,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 188 transitions, 394 flow [2023-01-27 22:42:59,308 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:42:59,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 188 transitions, 394 flow [2023-01-27 22:42:59,315 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 188 transitions, 394 flow [2023-01-27 22:42:59,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 188 transitions, 394 flow [2023-01-27 22:42:59,362 INFO L130 PetriNetUnfolder]: 18/188 cut-off events. [2023-01-27 22:42:59,362 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:42:59,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 18/188 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-01-27 22:42:59,364 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2023-01-27 22:43:04,584 INFO L134 LiptonReduction]: Checked pairs total: 2338 [2023-01-27 22:43:04,584 INFO L136 LiptonReduction]: Total number of compositions: 198 [2023-01-27 22:43:04,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:43:04,600 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;@38914fd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:43:04,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 22:43:04,609 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-01-27 22:43:04,610 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:43:04,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:04,610 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] [2023-01-27 22:43:04,611 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-27 22:43:04,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1992179177, now seen corresponding path program 1 times [2023-01-27 22:43:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517755289] [2023-01-27 22:43:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:04,810 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-27 22:43:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517755289] [2023-01-27 22:43:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517755289] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:04,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:04,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 22:43:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107833880] [2023-01-27 22:43:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:04,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 22:43:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:04,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 22:43:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 22:43:04,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 399 [2023-01-27 22:43:04,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 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-27 22:43:04,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:04,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 399 [2023-01-27 22:43:04,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:04,919 INFO L130 PetriNetUnfolder]: 324/461 cut-off events. [2023-01-27 22:43:04,921 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2023-01-27 22:43:04,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 461 events. 324/461 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1468 event pairs, 167 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 739. Up to 453 conditions per place. [2023-01-27 22:43:04,927 INFO L137 encePairwiseOnDemand]: 398/399 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-01-27 22:43:04,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2023-01-27 22:43:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 22:43:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 22:43:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 377 transitions. [2023-01-27 22:43:04,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724310776942356 [2023-01-27 22:43:04,944 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 377 transitions. [2023-01-27 22:43:04,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 377 transitions. [2023-01-27 22:43:04,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:04,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 377 transitions. [2023-01-27 22:43:04,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.5) internal successors, (377), 2 states have internal predecessors, (377), 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-27 22:43:04,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-27 22:43:04,957 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-27 22:43:04,958 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 377 transitions. [2023-01-27 22:43:04,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 120 flow [2023-01-27 22:43:04,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 22:43:04,964 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2023-01-27 22:43:04,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-01-27 22:43:04,970 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-01-27 22:43:04,971 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 60 flow [2023-01-27 22:43:04,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 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-27 22:43:04,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:04,971 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-27 22:43:04,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:43:04,972 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-27 22:43:04,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1504763739, now seen corresponding path program 1 times [2023-01-27 22:43:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434693295] [2023-01-27 22:43:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:05,157 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-27 22:43:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:05,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434693295] [2023-01-27 22:43:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434693295] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:43:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031394079] [2023-01-27 22:43:05,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:05,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:43:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:43:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:43:05,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 399 [2023-01-27 22:43:05,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 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-27 22:43:05,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:05,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 399 [2023-01-27 22:43:05,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:05,255 INFO L130 PetriNetUnfolder]: 330/496 cut-off events. [2023-01-27 22:43:05,255 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 22:43:05,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 496 events. 330/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1625 event pairs, 168 based on Foata normal form. 30/364 useless extension candidates. Maximal degree in co-relation 998. Up to 449 conditions per place. [2023-01-27 22:43:05,257 INFO L137 encePairwiseOnDemand]: 392/399 looper letters, 23 selfloop transitions, 2 changer transitions 21/49 dead transitions. [2023-01-27 22:43:05,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 202 flow [2023-01-27 22:43:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:43:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:43:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 807 transitions. [2023-01-27 22:43:05,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4045112781954887 [2023-01-27 22:43:05,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 807 transitions. [2023-01-27 22:43:05,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 807 transitions. [2023-01-27 22:43:05,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:05,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 807 transitions. [2023-01-27 22:43:05,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.4) internal successors, (807), 5 states have internal predecessors, (807), 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-27 22:43:05,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 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-27 22:43:05,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 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-27 22:43:05,265 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 60 flow. Second operand 5 states and 807 transitions. [2023-01-27 22:43:05,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 202 flow [2023-01-27 22:43:05,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 22:43:05,266 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 86 flow [2023-01-27 22:43:05,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, 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=5, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-01-27 22:43:05,267 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-27 22:43:05,267 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 86 flow [2023-01-27 22:43:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 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-27 22:43:05,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:05,268 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] [2023-01-27 22:43:05,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 22:43:05,268 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-27 22:43:05,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash 980333088, now seen corresponding path program 1 times [2023-01-27 22:43:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130221932] [2023-01-27 22:43:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130221932] [2023-01-27 22:43:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130221932] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:05,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:05,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:43:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684076494] [2023-01-27 22:43:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:05,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:43:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:43:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:43:05,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 399 [2023-01-27 22:43:05,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-27 22:43:05,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:05,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 399 [2023-01-27 22:43:05,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:05,491 INFO L130 PetriNetUnfolder]: 368/550 cut-off events. [2023-01-27 22:43:05,491 INFO L131 PetriNetUnfolder]: For 406/406 co-relation queries the response was YES. [2023-01-27 22:43:05,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 550 events. 368/550 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1953 event pairs, 194 based on Foata normal form. 24/401 useless extension candidates. Maximal degree in co-relation 1570. Up to 450 conditions per place. [2023-01-27 22:43:05,493 INFO L137 encePairwiseOnDemand]: 392/399 looper letters, 24 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2023-01-27 22:43:05,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 206 flow [2023-01-27 22:43:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:43:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:43:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2023-01-27 22:43:05,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041353383458647 [2023-01-27 22:43:05,496 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2023-01-27 22:43:05,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2023-01-27 22:43:05,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:05,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2023-01-27 22:43:05,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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-27 22:43:05,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:05,499 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:05,500 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 86 flow. Second operand 4 states and 645 transitions. [2023-01-27 22:43:05,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 206 flow [2023-01-27 22:43:05,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 186 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 22:43:05,502 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 94 flow [2023-01-27 22:43:05,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=94, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-01-27 22:43:05,503 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-01-27 22:43:05,505 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 94 flow [2023-01-27 22:43:05,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-27 22:43:05,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:05,506 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-27 22:43:05,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 22:43:05,506 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-27 22:43:05,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1036368596, now seen corresponding path program 1 times [2023-01-27 22:43:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644048701] [2023-01-27 22:43:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644048701] [2023-01-27 22:43:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644048701] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 22:43:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592902261] [2023-01-27 22:43:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:05,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:43:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:43:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:43:05,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 399 [2023-01-27 22:43:05,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-27 22:43:05,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:05,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 399 [2023-01-27 22:43:05,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:05,736 INFO L130 PetriNetUnfolder]: 340/485 cut-off events. [2023-01-27 22:43:05,736 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-01-27 22:43:05,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 485 events. 340/485 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1440 event pairs, 48 based on Foata normal form. 10/328 useless extension candidates. Maximal degree in co-relation 1358. Up to 390 conditions per place. [2023-01-27 22:43:05,738 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-01-27 22:43:05,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 198 flow [2023-01-27 22:43:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:43:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:43:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-01-27 22:43:05,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46115288220551376 [2023-01-27 22:43:05,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-01-27 22:43:05,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-01-27 22:43:05,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:05,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-01-27 22:43:05,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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-27 22:43:05,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 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-27 22:43:05,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 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-27 22:43:05,750 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 94 flow. Second operand 3 states and 552 transitions. [2023-01-27 22:43:05,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 198 flow [2023-01-27 22:43:05,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 22:43:05,752 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 115 flow [2023-01-27 22:43:05,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-01-27 22:43:05,753 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-01-27 22:43:05,753 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 115 flow [2023-01-27 22:43:05,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-27 22:43:05,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:05,754 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-27 22:43:05,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 22:43:05,754 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-27 22:43:05,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash -128823418, now seen corresponding path program 2 times [2023-01-27 22:43:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078685085] [2023-01-27 22:43:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078685085] [2023-01-27 22:43:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078685085] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:43:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120539314] [2023-01-27 22:43:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:05,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 22:43:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 22:43:05,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 22:43:05,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 399 [2023-01-27 22:43:05,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 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-27 22:43:05,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:05,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 399 [2023-01-27 22:43:05,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:06,167 INFO L130 PetriNetUnfolder]: 499/749 cut-off events. [2023-01-27 22:43:06,168 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2023-01-27 22:43:06,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 749 events. 499/749 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2727 event pairs, 123 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 2390. Up to 302 conditions per place. [2023-01-27 22:43:06,171 INFO L137 encePairwiseOnDemand]: 392/399 looper letters, 65 selfloop transitions, 8 changer transitions 2/77 dead transitions. [2023-01-27 22:43:06,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 77 transitions, 449 flow [2023-01-27 22:43:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:43:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:43:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1058 transitions. [2023-01-27 22:43:06,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441938178780284 [2023-01-27 22:43:06,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1058 transitions. [2023-01-27 22:43:06,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1058 transitions. [2023-01-27 22:43:06,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:06,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1058 transitions. [2023-01-27 22:43:06,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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-27 22:43:06,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:06,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:06,179 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 115 flow. Second operand 6 states and 1058 transitions. [2023-01-27 22:43:06,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 77 transitions, 449 flow [2023-01-27 22:43:06,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 77 transitions, 398 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-01-27 22:43:06,181 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 158 flow [2023-01-27 22:43:06,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-01-27 22:43:06,182 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-27 22:43:06,182 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 158 flow [2023-01-27 22:43:06,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 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-27 22:43:06,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:06,183 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-27 22:43:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 22:43:06,183 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-27 22:43:06,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -712620679, now seen corresponding path program 1 times [2023-01-27 22:43:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:06,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128317825] [2023-01-27 22:43:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:06,287 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-27 22:43:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:06,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128317825] [2023-01-27 22:43:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128317825] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:06,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599241453] [2023-01-27 22:43:06,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:06,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:06,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:06,294 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-27 22:43:06,321 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-27 22:43:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:06,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:43:06,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:06,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:06,550 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-27 22:43:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599241453] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:06,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 22:43:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187351945] [2023-01-27 22:43:06,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:43:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:43:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:43:06,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 399 [2023-01-27 22:43:06,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 158 flow. Second operand has 12 states, 12 states have (on average 152.16666666666666) internal successors, (1826), 12 states have internal predecessors, (1826), 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-27 22:43:06,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:06,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 399 [2023-01-27 22:43:06,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:06,804 INFO L130 PetriNetUnfolder]: 681/1073 cut-off events. [2023-01-27 22:43:06,804 INFO L131 PetriNetUnfolder]: For 1230/1283 co-relation queries the response was YES. [2023-01-27 22:43:06,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 1073 events. 681/1073 cut-off events. For 1230/1283 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4573 event pairs, 291 based on Foata normal form. 137/1047 useless extension candidates. Maximal degree in co-relation 3377. Up to 645 conditions per place. [2023-01-27 22:43:06,809 INFO L137 encePairwiseOnDemand]: 393/399 looper letters, 59 selfloop transitions, 5 changer transitions 4/72 dead transitions. [2023-01-27 22:43:06,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 432 flow [2023-01-27 22:43:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:43:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:43:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 950 transitions. [2023-01-27 22:43:06,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2023-01-27 22:43:06,811 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 950 transitions. [2023-01-27 22:43:06,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 950 transitions. [2023-01-27 22:43:06,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:06,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 950 transitions. [2023-01-27 22:43:06,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.33333333333334) internal successors, (950), 6 states have internal predecessors, (950), 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-27 22:43:06,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:06,817 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:06,817 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 158 flow. Second operand 6 states and 950 transitions. [2023-01-27 22:43:06,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 432 flow [2023-01-27 22:43:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 425 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 22:43:06,819 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 206 flow [2023-01-27 22:43:06,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-01-27 22:43:06,824 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-01-27 22:43:06,824 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 206 flow [2023-01-27 22:43:06,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 152.16666666666666) internal successors, (1826), 12 states have internal predecessors, (1826), 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-27 22:43:06,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:06,825 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-27 22:43:06,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 22:43:07,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 22:43:07,031 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-27 22:43:07,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1630668423, now seen corresponding path program 1 times [2023-01-27 22:43:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19484042] [2023-01-27 22:43:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19484042] [2023-01-27 22:43:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19484042] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:07,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:43:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:43:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005905355] [2023-01-27 22:43:07,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:07,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:43:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:43:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:43:07,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 399 [2023-01-27 22:43:07,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 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-27 22:43:07,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:07,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 399 [2023-01-27 22:43:07,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:07,350 INFO L130 PetriNetUnfolder]: 1125/1814 cut-off events. [2023-01-27 22:43:07,350 INFO L131 PetriNetUnfolder]: For 2644/2698 co-relation queries the response was YES. [2023-01-27 22:43:07,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 1814 events. 1125/1814 cut-off events. For 2644/2698 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9050 event pairs, 206 based on Foata normal form. 134/1655 useless extension candidates. Maximal degree in co-relation 6220. Up to 793 conditions per place. [2023-01-27 22:43:07,358 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 61 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2023-01-27 22:43:07,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 535 flow [2023-01-27 22:43:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:43:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:43:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2023-01-27 22:43:07,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2023-01-27 22:43:07,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 744 transitions. [2023-01-27 22:43:07,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 744 transitions. [2023-01-27 22:43:07,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:07,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 744 transitions. [2023-01-27 22:43:07,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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-27 22:43:07,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:07,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:07,363 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 206 flow. Second operand 4 states and 744 transitions. [2023-01-27 22:43:07,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 535 flow [2023-01-27 22:43:07,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 511 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 22:43:07,366 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 300 flow [2023-01-27 22:43:07,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-01-27 22:43:07,366 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2023-01-27 22:43:07,366 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 300 flow [2023-01-27 22:43:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 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-27 22:43:07,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:07,367 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-27 22:43:07,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 22:43:07,367 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-27 22:43:07,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 883003992, now seen corresponding path program 2 times [2023-01-27 22:43:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261390214] [2023-01-27 22:43:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261390214] [2023-01-27 22:43:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261390214] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895405104] [2023-01-27 22:43:08,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:43:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:08,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:08,079 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-27 22:43:08,150 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-27 22:43:08,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:43:08,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:08,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 29 conjunts are in the unsatisfiable core [2023-01-27 22:43:08,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:08,357 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-27 22:43:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:08,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:08,428 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_255 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_255) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2023-01-27 22:43:08,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:08,450 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 45 treesize of output 37 [2023-01-27 22:43:08,455 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 24 treesize of output 18 [2023-01-27 22:43:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:43:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895405104] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:08,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2023-01-27 22:43:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660657005] [2023-01-27 22:43:08,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 22:43:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 22:43:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2023-01-27 22:43:08,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 399 [2023-01-27 22:43:08,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 300 flow. Second operand has 20 states, 20 states have (on average 127.8) internal successors, (2556), 20 states have internal predecessors, (2556), 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-27 22:43:08,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:08,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 399 [2023-01-27 22:43:08,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:09,098 INFO L130 PetriNetUnfolder]: 1143/1887 cut-off events. [2023-01-27 22:43:09,098 INFO L131 PetriNetUnfolder]: For 2931/2956 co-relation queries the response was YES. [2023-01-27 22:43:09,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7535 conditions, 1887 events. 1143/1887 cut-off events. For 2931/2956 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9079 event pairs, 160 based on Foata normal form. 33/1622 useless extension candidates. Maximal degree in co-relation 7518. Up to 1129 conditions per place. [2023-01-27 22:43:09,109 INFO L137 encePairwiseOnDemand]: 390/399 looper letters, 101 selfloop transitions, 23 changer transitions 0/126 dead transitions. [2023-01-27 22:43:09,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 913 flow [2023-01-27 22:43:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 22:43:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 22:43:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1732 transitions. [2023-01-27 22:43:09,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33391170233275497 [2023-01-27 22:43:09,114 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1732 transitions. [2023-01-27 22:43:09,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1732 transitions. [2023-01-27 22:43:09,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:09,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1732 transitions. [2023-01-27 22:43:09,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 133.23076923076923) internal successors, (1732), 13 states have internal predecessors, (1732), 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-27 22:43:09,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:09,123 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:09,123 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 300 flow. Second operand 13 states and 1732 transitions. [2023-01-27 22:43:09,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 913 flow [2023-01-27 22:43:09,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 126 transitions, 841 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-01-27 22:43:09,129 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 405 flow [2023-01-27 22:43:09,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=405, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-01-27 22:43:09,131 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2023-01-27 22:43:09,131 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 405 flow [2023-01-27 22:43:09,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 127.8) internal successors, (2556), 20 states have internal predecessors, (2556), 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-27 22:43:09,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:09,132 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-27 22:43:09,147 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-27 22:43:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-01-27 22:43:09,338 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-27 22:43:09,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1891154340, now seen corresponding path program 3 times [2023-01-27 22:43:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534319907] [2023-01-27 22:43:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534319907] [2023-01-27 22:43:10,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534319907] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102746444] [2023-01-27 22:43:10,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:43:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:10,061 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-27 22:43:10,064 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-27 22:43:10,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:43:10,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:10,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-27 22:43:10,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:10,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:10,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:43:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:10,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:10,456 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_312) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2023-01-27 22:43:10,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:10,502 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 45 treesize of output 37 [2023-01-27 22:43:10,506 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 24 treesize of output 18 [2023-01-27 22:43:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102746444] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:10,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-01-27 22:43:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770369296] [2023-01-27 22:43:10,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-27 22:43:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-27 22:43:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=559, Unknown=1, NotChecked=48, Total=702 [2023-01-27 22:43:10,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 399 [2023-01-27 22:43:10,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 405 flow. Second operand has 27 states, 27 states have (on average 116.44444444444444) internal successors, (3144), 27 states have internal predecessors, (3144), 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-27 22:43:10,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:10,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 399 [2023-01-27 22:43:10,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:14,118 INFO L130 PetriNetUnfolder]: 6091/9385 cut-off events. [2023-01-27 22:43:14,118 INFO L131 PetriNetUnfolder]: For 24426/24426 co-relation queries the response was YES. [2023-01-27 22:43:14,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39017 conditions, 9385 events. 6091/9385 cut-off events. For 24426/24426 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 55771 event pairs, 238 based on Foata normal form. 646/8952 useless extension candidates. Maximal degree in co-relation 38996. Up to 3372 conditions per place. [2023-01-27 22:43:14,179 INFO L137 encePairwiseOnDemand]: 379/399 looper letters, 423 selfloop transitions, 220 changer transitions 0/644 dead transitions. [2023-01-27 22:43:14,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 644 transitions, 5474 flow [2023-01-27 22:43:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-27 22:43:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-01-27 22:43:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5797 transitions. [2023-01-27 22:43:14,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3091238735135712 [2023-01-27 22:43:14,192 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 5797 transitions. [2023-01-27 22:43:14,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 5797 transitions. [2023-01-27 22:43:14,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:14,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 5797 transitions. [2023-01-27 22:43:14,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 123.34042553191489) internal successors, (5797), 47 states have internal predecessors, (5797), 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-27 22:43:14,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 399.0) internal successors, (19152), 48 states have internal predecessors, (19152), 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-27 22:43:14,234 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 399.0) internal successors, (19152), 48 states have internal predecessors, (19152), 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-27 22:43:14,234 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 405 flow. Second operand 47 states and 5797 transitions. [2023-01-27 22:43:14,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 644 transitions, 5474 flow [2023-01-27 22:43:14,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 644 transitions, 5319 flow, removed 75 selfloop flow, removed 2 redundant places. [2023-01-27 22:43:14,260 INFO L231 Difference]: Finished difference. Result has 147 places, 300 transitions, 3299 flow [2023-01-27 22:43:14,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3299, PETRI_PLACES=147, PETRI_TRANSITIONS=300} [2023-01-27 22:43:14,261 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 115 predicate places. [2023-01-27 22:43:14,261 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 300 transitions, 3299 flow [2023-01-27 22:43:14,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 116.44444444444444) internal successors, (3144), 27 states have internal predecessors, (3144), 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-27 22:43:14,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:14,262 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-27 22:43:14,270 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-27 22:43:14,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:14,471 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-27 22:43:14,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1608264000, now seen corresponding path program 4 times [2023-01-27 22:43:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106129876] [2023-01-27 22:43:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106129876] [2023-01-27 22:43:15,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106129876] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295761315] [2023-01-27 22:43:15,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:43:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:15,132 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-27 22:43:15,170 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-27 22:43:15,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:43:15,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:15,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-27 22:43:15,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:15,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:15,403 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-27 22:43:15,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:15,456 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-27 22:43:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:15,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:15,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:15,735 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 85 treesize of output 77 [2023-01-27 22:43:15,740 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 64 treesize of output 52 [2023-01-27 22:43:15,743 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 52 treesize of output 46 [2023-01-27 22:43:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295761315] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:15,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-01-27 22:43:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924826423] [2023-01-27 22:43:15,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:15,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-27 22:43:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-27 22:43:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=690, Unknown=1, NotChecked=0, Total=812 [2023-01-27 22:43:15,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 399 [2023-01-27 22:43:15,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 300 transitions, 3299 flow. Second operand has 29 states, 29 states have (on average 113.10344827586206) internal successors, (3280), 29 states have internal predecessors, (3280), 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-27 22:43:15,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:15,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 399 [2023-01-27 22:43:15,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:20,854 INFO L130 PetriNetUnfolder]: 11558/17902 cut-off events. [2023-01-27 22:43:20,854 INFO L131 PetriNetUnfolder]: For 348534/348534 co-relation queries the response was YES. [2023-01-27 22:43:20,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129316 conditions, 17902 events. 11558/17902 cut-off events. For 348534/348534 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 120205 event pairs, 741 based on Foata normal form. 144/17042 useless extension candidates. Maximal degree in co-relation 129260. Up to 7830 conditions per place. [2023-01-27 22:43:21,011 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 756 selfloop transitions, 411 changer transitions 5/1173 dead transitions. [2023-01-27 22:43:21,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1173 transitions, 15347 flow [2023-01-27 22:43:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-27 22:43:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-27 22:43:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 5042 transitions. [2023-01-27 22:43:21,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30087122568325575 [2023-01-27 22:43:21,021 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 5042 transitions. [2023-01-27 22:43:21,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 5042 transitions. [2023-01-27 22:43:21,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:21,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 5042 transitions. [2023-01-27 22:43:21,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 120.04761904761905) internal successors, (5042), 42 states have internal predecessors, (5042), 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-27 22:43:21,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 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-27 22:43:21,047 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 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-27 22:43:21,047 INFO L175 Difference]: Start difference. First operand has 147 places, 300 transitions, 3299 flow. Second operand 42 states and 5042 transitions. [2023-01-27 22:43:21,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1173 transitions, 15347 flow [2023-01-27 22:43:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1173 transitions, 13713 flow, removed 806 selfloop flow, removed 8 redundant places. [2023-01-27 22:43:22,669 INFO L231 Difference]: Finished difference. Result has 202 places, 612 transitions, 7345 flow [2023-01-27 22:43:22,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=2791, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7345, PETRI_PLACES=202, PETRI_TRANSITIONS=612} [2023-01-27 22:43:22,670 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2023-01-27 22:43:22,670 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 612 transitions, 7345 flow [2023-01-27 22:43:22,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 113.10344827586206) internal successors, (3280), 29 states have internal predecessors, (3280), 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-27 22:43:22,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:22,671 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-27 22:43:22,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:22,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:22,876 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-27 22:43:22,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1330831581, now seen corresponding path program 5 times [2023-01-27 22:43:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135235075] [2023-01-27 22:43:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135235075] [2023-01-27 22:43:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135235075] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518918572] [2023-01-27 22:43:23,576 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:43:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:23,577 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-27 22:43:23,578 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-27 22:43:23,683 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:43:23,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:23,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-27 22:43:23,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:23,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:23,787 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-27 22:43:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:43:23,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:23,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:23,882 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 45 treesize of output 37 [2023-01-27 22:43:23,885 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 24 treesize of output 18 [2023-01-27 22:43:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 22:43:23,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518918572] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:23,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:23,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 21 [2023-01-27 22:43:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324403004] [2023-01-27 22:43:23,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:23,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-27 22:43:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-27 22:43:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=399, Unknown=1, NotChecked=0, Total=462 [2023-01-27 22:43:23,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 399 [2023-01-27 22:43:23,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 612 transitions, 7345 flow. Second operand has 22 states, 22 states have (on average 127.45454545454545) internal successors, (2804), 22 states have internal predecessors, (2804), 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-27 22:43:23,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:23,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 399 [2023-01-27 22:43:23,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:27,770 INFO L130 PetriNetUnfolder]: 11874/18445 cut-off events. [2023-01-27 22:43:27,771 INFO L131 PetriNetUnfolder]: For 401522/401535 co-relation queries the response was YES. [2023-01-27 22:43:27,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142148 conditions, 18445 events. 11874/18445 cut-off events. For 401522/401535 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 124334 event pairs, 1944 based on Foata normal form. 17/17693 useless extension candidates. Maximal degree in co-relation 142074. Up to 9803 conditions per place. [2023-01-27 22:43:28,118 INFO L137 encePairwiseOnDemand]: 390/399 looper letters, 497 selfloop transitions, 311 changer transitions 0/812 dead transitions. [2023-01-27 22:43:28,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 812 transitions, 10844 flow [2023-01-27 22:43:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 22:43:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 22:43:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1720 transitions. [2023-01-27 22:43:28,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3315982263350684 [2023-01-27 22:43:28,120 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1720 transitions. [2023-01-27 22:43:28,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1720 transitions. [2023-01-27 22:43:28,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:28,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1720 transitions. [2023-01-27 22:43:28,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 132.30769230769232) internal successors, (1720), 13 states have internal predecessors, (1720), 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-27 22:43:28,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:28,128 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:28,128 INFO L175 Difference]: Start difference. First operand has 202 places, 612 transitions, 7345 flow. Second operand 13 states and 1720 transitions. [2023-01-27 22:43:28,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 812 transitions, 10844 flow [2023-01-27 22:43:30,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 812 transitions, 10673 flow, removed 62 selfloop flow, removed 13 redundant places. [2023-01-27 22:43:30,979 INFO L231 Difference]: Finished difference. Result has 204 places, 643 transitions, 8598 flow [2023-01-27 22:43:30,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=7194, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8598, PETRI_PLACES=204, PETRI_TRANSITIONS=643} [2023-01-27 22:43:30,980 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2023-01-27 22:43:30,980 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 643 transitions, 8598 flow [2023-01-27 22:43:30,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 127.45454545454545) internal successors, (2804), 22 states have internal predecessors, (2804), 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-27 22:43:30,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:30,981 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-27 22:43:30,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:31,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-27 22:43:31,185 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:43:31,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 858752648, now seen corresponding path program 1 times [2023-01-27 22:43:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201235941] [2023-01-27 22:43:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201235941] [2023-01-27 22:43:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201235941] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339821664] [2023-01-27 22:43:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:31,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:31,284 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-27 22:43:31,286 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-27 22:43:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:31,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:43:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:31,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:43:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339821664] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:31,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-27 22:43:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134478520] [2023-01-27 22:43:31,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:31,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:43:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:43:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:43:31,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 399 [2023-01-27 22:43:31,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 643 transitions, 8598 flow. Second operand has 12 states, 12 states have (on average 152.16666666666666) internal successors, (1826), 12 states have internal predecessors, (1826), 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-27 22:43:31,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:31,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 399 [2023-01-27 22:43:31,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:36,483 INFO L130 PetriNetUnfolder]: 15656/24952 cut-off events. [2023-01-27 22:43:36,483 INFO L131 PetriNetUnfolder]: For 619640/619672 co-relation queries the response was YES. [2023-01-27 22:43:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192292 conditions, 24952 events. 15656/24952 cut-off events. For 619640/619672 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 182089 event pairs, 5139 based on Foata normal form. 820/24737 useless extension candidates. Maximal degree in co-relation 192215. Up to 17920 conditions per place. [2023-01-27 22:43:36,781 INFO L137 encePairwiseOnDemand]: 394/399 looper letters, 672 selfloop transitions, 12 changer transitions 421/1111 dead transitions. [2023-01-27 22:43:36,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1111 transitions, 16440 flow [2023-01-27 22:43:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:43:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:43:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 950 transitions. [2023-01-27 22:43:36,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2023-01-27 22:43:36,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 950 transitions. [2023-01-27 22:43:36,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 950 transitions. [2023-01-27 22:43:36,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:36,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 950 transitions. [2023-01-27 22:43:36,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.33333333333334) internal successors, (950), 6 states have internal predecessors, (950), 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-27 22:43:36,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:36,785 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 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-27 22:43:36,786 INFO L175 Difference]: Start difference. First operand has 204 places, 643 transitions, 8598 flow. Second operand 6 states and 950 transitions. [2023-01-27 22:43:36,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 1111 transitions, 16440 flow [2023-01-27 22:43:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1111 transitions, 16413 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-27 22:43:41,845 INFO L231 Difference]: Finished difference. Result has 208 places, 645 transitions, 8821 flow [2023-01-27 22:43:41,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=8577, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8821, PETRI_PLACES=208, PETRI_TRANSITIONS=645} [2023-01-27 22:43:41,846 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2023-01-27 22:43:41,847 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 645 transitions, 8821 flow [2023-01-27 22:43:41,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 152.16666666666666) internal successors, (1826), 12 states have internal predecessors, (1826), 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-27 22:43:41,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:41,855 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-27 22:43:41,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-27 22:43:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:42,060 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:43:42,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1483262711, now seen corresponding path program 6 times [2023-01-27 22:43:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944178518] [2023-01-27 22:43:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944178518] [2023-01-27 22:43:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944178518] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009841868] [2023-01-27 22:43:42,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:43:42,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:42,969 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:43,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:43:43,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:43:43,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:43,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjunts are in the unsatisfiable core [2023-01-27 22:43:43,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:43,240 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-27 22:43:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:43,268 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-27 22:43:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:43:43,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:43,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:43,392 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 167 treesize of output 151 [2023-01-27 22:43:43,397 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 64 treesize of output 58 [2023-01-27 22:43:43,400 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 58 treesize of output 46 [2023-01-27 22:43:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 22:43:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009841868] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:43,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:43,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2023-01-27 22:43:43,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293620662] [2023-01-27 22:43:43,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:43,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 22:43:43,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 22:43:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=431, Unknown=10, NotChecked=0, Total=506 [2023-01-27 22:43:43,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 399 [2023-01-27 22:43:43,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 645 transitions, 8821 flow. Second operand has 23 states, 23 states have (on average 124.56521739130434) internal successors, (2865), 23 states have internal predecessors, (2865), 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-27 22:43:43,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:43,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 399 [2023-01-27 22:43:43,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:48,547 INFO L130 PetriNetUnfolder]: 13470/21523 cut-off events. [2023-01-27 22:43:48,547 INFO L131 PetriNetUnfolder]: For 487546/487572 co-relation queries the response was YES. [2023-01-27 22:43:48,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167351 conditions, 21523 events. 13470/21523 cut-off events. For 487546/487572 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 152404 event pairs, 2061 based on Foata normal form. 34/20688 useless extension candidates. Maximal degree in co-relation 167270. Up to 9371 conditions per place. [2023-01-27 22:43:48,761 INFO L137 encePairwiseOnDemand]: 391/399 looper letters, 521 selfloop transitions, 317 changer transitions 4/846 dead transitions. [2023-01-27 22:43:48,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 846 transitions, 12327 flow [2023-01-27 22:43:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 22:43:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 22:43:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1681 transitions. [2023-01-27 22:43:48,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3240794293425872 [2023-01-27 22:43:48,763 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1681 transitions. [2023-01-27 22:43:48,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1681 transitions. [2023-01-27 22:43:48,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:48,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1681 transitions. [2023-01-27 22:43:48,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 129.30769230769232) internal successors, (1681), 13 states have internal predecessors, (1681), 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-27 22:43:48,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:48,767 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 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-27 22:43:48,768 INFO L175 Difference]: Start difference. First operand has 208 places, 645 transitions, 8821 flow. Second operand 13 states and 1681 transitions. [2023-01-27 22:43:48,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 846 transitions, 12327 flow [2023-01-27 22:43:52,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 846 transitions, 12176 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-01-27 22:43:53,002 INFO L231 Difference]: Finished difference. Result has 218 places, 655 transitions, 9614 flow [2023-01-27 22:43:53,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=8686, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9614, PETRI_PLACES=218, PETRI_TRANSITIONS=655} [2023-01-27 22:43:53,002 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2023-01-27 22:43:53,003 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 655 transitions, 9614 flow [2023-01-27 22:43:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 124.56521739130434) internal successors, (2865), 23 states have internal predecessors, (2865), 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-27 22:43:53,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:53,003 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-27 22:43:53,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:53,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:53,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:43:53,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -590373184, now seen corresponding path program 2 times [2023-01-27 22:43:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953314904] [2023-01-27 22:43:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:43:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953314904] [2023-01-27 22:43:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953314904] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396844922] [2023-01-27 22:43:53,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:43:53,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:53,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:53,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:43:53,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:43:53,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:53,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:43:53,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 22:43:53,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 22:43:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396844922] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:43:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 22:43:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-01-27 22:43:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939104725] [2023-01-27 22:43:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:43:53,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:43:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:43:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-27 22:43:53,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 399 [2023-01-27 22:43:53,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 655 transitions, 9614 flow. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-27 22:43:53,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:53,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 399 [2023-01-27 22:43:53,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:57,415 INFO L130 PetriNetUnfolder]: 12749/19909 cut-off events. [2023-01-27 22:43:57,415 INFO L131 PetriNetUnfolder]: For 539800/539817 co-relation queries the response was YES. [2023-01-27 22:43:57,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169835 conditions, 19909 events. 12749/19909 cut-off events. For 539800/539817 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 137318 event pairs, 2539 based on Foata normal form. 186/19121 useless extension candidates. Maximal degree in co-relation 169755. Up to 16451 conditions per place. [2023-01-27 22:43:57,619 INFO L137 encePairwiseOnDemand]: 395/399 looper letters, 652 selfloop transitions, 96 changer transitions 17/770 dead transitions. [2023-01-27 22:43:57,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 770 transitions, 13180 flow [2023-01-27 22:43:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:43:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:43:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 748 transitions. [2023-01-27 22:43:57,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46867167919799496 [2023-01-27 22:43:57,621 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 748 transitions. [2023-01-27 22:43:57,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 748 transitions. [2023-01-27 22:43:57,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:57,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 748 transitions. [2023-01-27 22:43:57,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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-27 22:43:57,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:57,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 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-27 22:43:57,623 INFO L175 Difference]: Start difference. First operand has 218 places, 655 transitions, 9614 flow. Second operand 4 states and 748 transitions. [2023-01-27 22:43:57,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 770 transitions, 13180 flow [2023-01-27 22:44:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 770 transitions, 12870 flow, removed 46 selfloop flow, removed 12 redundant places. [2023-01-27 22:44:01,116 INFO L231 Difference]: Finished difference. Result has 209 places, 674 transitions, 10086 flow [2023-01-27 22:44:01,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=9308, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10086, PETRI_PLACES=209, PETRI_TRANSITIONS=674} [2023-01-27 22:44:01,117 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2023-01-27 22:44:01,117 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 674 transitions, 10086 flow [2023-01-27 22:44:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-27 22:44:01,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:44:01,117 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, 1] [2023-01-27 22:44:01,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 22:44:01,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 22:44:01,322 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:44:01,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:44:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -71767745, now seen corresponding path program 1 times [2023-01-27 22:44:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:44:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554210679] [2023-01-27 22:44:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:44:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:44:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:44:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:44:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:44:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554210679] [2023-01-27 22:44:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554210679] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:44:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71940157] [2023-01-27 22:44:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:44:02,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:44:02,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:44:02,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:44:02,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:44:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:44:02,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-27 22:44:02,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:44:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:44:02,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:44:02,710 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-27 22:44:02,710 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 24 treesize of output 11 [2023-01-27 22:44:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:44:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71940157] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:44:02,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:44:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2023-01-27 22:44:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97374141] [2023-01-27 22:44:02,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:44:02,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-27 22:44:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:44:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-27 22:44:02,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2023-01-27 22:44:02,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 399 [2023-01-27 22:44:02,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 674 transitions, 10086 flow. Second operand has 29 states, 29 states have (on average 122.44827586206897) internal successors, (3551), 29 states have internal predecessors, (3551), 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-27 22:44:02,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:44:02,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 399 [2023-01-27 22:44:02,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:44:17,332 INFO L130 PetriNetUnfolder]: 40907/62664 cut-off events. [2023-01-27 22:44:17,332 INFO L131 PetriNetUnfolder]: For 1858356/1858383 co-relation queries the response was YES. [2023-01-27 22:44:17,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554702 conditions, 62664 events. 40907/62664 cut-off events. For 1858356/1858383 co-relation queries the response was YES. Maximal size of possible extension queue 2770. Compared 483971 event pairs, 3562 based on Foata normal form. 2286/62176 useless extension candidates. Maximal degree in co-relation 554624. Up to 26527 conditions per place. [2023-01-27 22:44:18,453 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 2472 selfloop transitions, 796 changer transitions 13/3284 dead transitions. [2023-01-27 22:44:18,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 3284 transitions, 54266 flow [2023-01-27 22:44:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-27 22:44:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-01-27 22:44:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4364 transitions. [2023-01-27 22:44:18,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32168656936458795 [2023-01-27 22:44:18,457 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4364 transitions. [2023-01-27 22:44:18,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4364 transitions. [2023-01-27 22:44:18,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:44:18,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4364 transitions. [2023-01-27 22:44:18,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 128.35294117647058) internal successors, (4364), 34 states have internal predecessors, (4364), 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-27 22:44:18,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 399.0) internal successors, (13965), 35 states have internal predecessors, (13965), 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-27 22:44:18,469 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 399.0) internal successors, (13965), 35 states have internal predecessors, (13965), 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-27 22:44:18,469 INFO L175 Difference]: Start difference. First operand has 209 places, 674 transitions, 10086 flow. Second operand 34 states and 4364 transitions. [2023-01-27 22:44:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 3284 transitions, 54266 flow [2023-01-27 22:44:42,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 3284 transitions, 53604 flow, removed 331 selfloop flow, removed 4 redundant places. [2023-01-27 22:44:42,844 INFO L231 Difference]: Finished difference. Result has 243 places, 1546 transitions, 29786 flow [2023-01-27 22:44:42,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=10002, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=29786, PETRI_PLACES=243, PETRI_TRANSITIONS=1546} [2023-01-27 22:44:42,845 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2023-01-27 22:44:42,845 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 1546 transitions, 29786 flow [2023-01-27 22:44:42,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 122.44827586206897) internal successors, (3551), 29 states have internal predecessors, (3551), 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-27 22:44:42,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:44:42,846 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, 1] [2023-01-27 22:44:42,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-27 22:44:43,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-27 22:44:43,051 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:44:43,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:44:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash -128692115, now seen corresponding path program 2 times [2023-01-27 22:44:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:44:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408203350] [2023-01-27 22:44:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:44:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:44:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:44:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:44:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:44:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408203350] [2023-01-27 22:44:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408203350] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:44:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942298169] [2023-01-27 22:44:44,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:44:44,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:44:44,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:44:44,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:44:44,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:44:44,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:44:44,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:44:44,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-27 22:44:44,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:44:44,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:44:44,776 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-27 22:44:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:44:44,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:44:44,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:44:44,920 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 44 treesize of output 36 [2023-01-27 22:44:44,924 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 24 treesize of output 18 [2023-01-27 22:44:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 22:44:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942298169] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:44:45,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:44:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 30 [2023-01-27 22:44:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999722865] [2023-01-27 22:44:45,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:44:45,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:44:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:44:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:44:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2023-01-27 22:44:45,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 399 [2023-01-27 22:44:45,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1546 transitions, 29786 flow. Second operand has 31 states, 31 states have (on average 104.38709677419355) internal successors, (3236), 31 states have internal predecessors, (3236), 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-27 22:44:45,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:44:45,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 399 [2023-01-27 22:44:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:45:10,292 INFO L130 PetriNetUnfolder]: 51705/78724 cut-off events. [2023-01-27 22:45:10,293 INFO L131 PetriNetUnfolder]: For 2507024/2507024 co-relation queries the response was YES. [2023-01-27 22:45:11,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706888 conditions, 78724 events. 51705/78724 cut-off events. For 2507024/2507024 co-relation queries the response was YES. Maximal size of possible extension queue 3318. Compared 616488 event pairs, 4091 based on Foata normal form. 3924/79143 useless extension candidates. Maximal degree in co-relation 706802. Up to 33706 conditions per place. [2023-01-27 22:45:11,751 INFO L137 encePairwiseOnDemand]: 384/399 looper letters, 2537 selfloop transitions, 1124 changer transitions 235/3897 dead transitions. [2023-01-27 22:45:11,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 3897 transitions, 71975 flow [2023-01-27 22:45:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-27 22:45:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-27 22:45:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3510 transitions. [2023-01-27 22:45:11,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.274906015037594 [2023-01-27 22:45:11,755 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3510 transitions. [2023-01-27 22:45:11,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3510 transitions. [2023-01-27 22:45:11,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:45:11,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3510 transitions. [2023-01-27 22:45:11,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 109.6875) internal successors, (3510), 32 states have internal predecessors, (3510), 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-27 22:45:11,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 399.0) internal successors, (13167), 33 states have internal predecessors, (13167), 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-27 22:45:11,765 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 399.0) internal successors, (13167), 33 states have internal predecessors, (13167), 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-27 22:45:11,765 INFO L175 Difference]: Start difference. First operand has 243 places, 1546 transitions, 29786 flow. Second operand 32 states and 3510 transitions. [2023-01-27 22:45:11,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 3897 transitions, 71975 flow [2023-01-27 22:46:13,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 3897 transitions, 68582 flow, removed 945 selfloop flow, removed 10 redundant places. [2023-01-27 22:46:13,931 INFO L231 Difference]: Finished difference. Result has 270 places, 1927 transitions, 39087 flow [2023-01-27 22:46:13,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=24876, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=624, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=39087, PETRI_PLACES=270, PETRI_TRANSITIONS=1927} [2023-01-27 22:46:13,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 238 predicate places. [2023-01-27 22:46:13,932 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 1927 transitions, 39087 flow [2023-01-27 22:46:13,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 104.38709677419355) internal successors, (3236), 31 states have internal predecessors, (3236), 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-27 22:46:13,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:13,933 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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-27 22:46:13,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 22:46:14,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 22:46:14,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:46:14,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 636017453, now seen corresponding path program 3 times [2023-01-27 22:46:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298431274] [2023-01-27 22:46:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:15,419 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-27 22:46:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298431274] [2023-01-27 22:46:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298431274] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353080432] [2023-01-27 22:46:15,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:46:15,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:15,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:46:15,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:46:15,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:15,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-27 22:46:15,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:15,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:15,698 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-27 22:46:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:46:15,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:15,734 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_787) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2023-01-27 22:46:15,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:15,744 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 44 treesize of output 36 [2023-01-27 22:46:15,746 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 24 treesize of output 18 [2023-01-27 22:46:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-01-27 22:46:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353080432] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:15,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 25 [2023-01-27 22:46:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626769492] [2023-01-27 22:46:15,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 22:46:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 22:46:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=529, Unknown=1, NotChecked=46, Total=650 [2023-01-27 22:46:15,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 399 [2023-01-27 22:46:15,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1927 transitions, 39087 flow. Second operand has 26 states, 26 states have (on average 115.57692307692308) internal successors, (3005), 26 states have internal predecessors, (3005), 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-27 22:46:15,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:15,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 399 [2023-01-27 22:46:15,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:43,535 INFO L130 PetriNetUnfolder]: 48112/72830 cut-off events. [2023-01-27 22:46:43,535 INFO L131 PetriNetUnfolder]: For 2215135/2215187 co-relation queries the response was YES. [2023-01-27 22:46:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682286 conditions, 72830 events. 48112/72830 cut-off events. For 2215135/2215187 co-relation queries the response was YES. Maximal size of possible extension queue 3021. Compared 559607 event pairs, 5570 based on Foata normal form. 1494/71120 useless extension candidates. Maximal degree in co-relation 682192. Up to 35977 conditions per place. [2023-01-27 22:46:44,920 INFO L137 encePairwiseOnDemand]: 386/399 looper letters, 1711 selfloop transitions, 696 changer transitions 1/2412 dead transitions. [2023-01-27 22:46:44,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 2412 transitions, 52260 flow [2023-01-27 22:46:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 22:46:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 22:46:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2035 transitions. [2023-01-27 22:46:44,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3000147427392009 [2023-01-27 22:46:44,922 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2035 transitions. [2023-01-27 22:46:44,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2035 transitions. [2023-01-27 22:46:44,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:44,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2035 transitions. [2023-01-27 22:46:44,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 119.70588235294117) internal successors, (2035), 17 states have internal predecessors, (2035), 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-27 22:46:44,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 399.0) internal successors, (7182), 18 states have internal predecessors, (7182), 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-27 22:46:44,928 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 399.0) internal successors, (7182), 18 states have internal predecessors, (7182), 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-27 22:46:44,928 INFO L175 Difference]: Start difference. First operand has 270 places, 1927 transitions, 39087 flow. Second operand 17 states and 2035 transitions. [2023-01-27 22:46:44,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 2412 transitions, 52260 flow [2023-01-27 22:47:56,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 2412 transitions, 51199 flow, removed 430 selfloop flow, removed 16 redundant places. [2023-01-27 22:47:56,928 INFO L231 Difference]: Finished difference. Result has 274 places, 1988 transitions, 41091 flow [2023-01-27 22:47:56,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=38012, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=633, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=41091, PETRI_PLACES=274, PETRI_TRANSITIONS=1988} [2023-01-27 22:47:56,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 242 predicate places. [2023-01-27 22:47:56,935 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 1988 transitions, 41091 flow [2023-01-27 22:47:56,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 115.57692307692308) internal successors, (3005), 26 states have internal predecessors, (3005), 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-27 22:47:56,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:56,941 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, 1, 1] [2023-01-27 22:47:56,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:57,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 22:47:57,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:47:57,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 554783110, now seen corresponding path program 1 times [2023-01-27 22:47:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252296480] [2023-01-27 22:47:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252296480] [2023-01-27 22:47:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252296480] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124143236] [2023-01-27 22:47:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:58,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:58,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:58,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:58,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:47:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:58,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 56 conjunts are in the unsatisfiable core [2023-01-27 22:47:58,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:47:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:48:01,217 WARN L839 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~q2~0.base))) (let ((.cse0 (select .cse1 (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (= c_~N~0 (+ c_~t~0 .cse0)) (= .cse0 0) (not (= (select .cse1 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))))))) is different from false [2023-01-27 22:48:03,385 INFO L321 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2023-01-27 22:48:03,386 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 73 treesize of output 98 [2023-01-27 22:48:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-01-27 22:48:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124143236] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:48:03,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:48:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 36 [2023-01-27 22:48:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504683430] [2023-01-27 22:48:03,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:48:03,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:48:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:48:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1210, Unknown=1, NotChecked=70, Total=1406 [2023-01-27 22:48:03,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 399 [2023-01-27 22:48:03,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1988 transitions, 41091 flow. Second operand has 38 states, 38 states have (on average 111.21052631578948) internal successors, (4226), 38 states have internal predecessors, (4226), 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-27 22:48:03,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:03,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 399 [2023-01-27 22:48:03,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:15,484 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse2 (select |c_#memory_int| ~q2~0.base))) (let ((.cse1 (select .cse2 (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (= c_~N~0 (+ c_~t~0 .cse1)) (= .cse1 0) (not (= (select .cse2 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))))))))) (and .cse0 (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) .cse0 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2023-01-27 22:48:18,422 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-27 22:48:22,771 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-27 22:48:27,875 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-27 22:48:40,718 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-27 22:48:56,970 INFO L130 PetriNetUnfolder]: 52850/80922 cut-off events. [2023-01-27 22:48:56,970 INFO L131 PetriNetUnfolder]: For 2305509/2305509 co-relation queries the response was YES. [2023-01-27 22:48:58,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752354 conditions, 80922 events. 52850/80922 cut-off events. For 2305509/2305509 co-relation queries the response was YES. Maximal size of possible extension queue 3388. Compared 644441 event pairs, 7959 based on Foata normal form. 34/77170 useless extension candidates. Maximal degree in co-relation 752257. Up to 71959 conditions per place. [2023-01-27 22:48:58,450 INFO L137 encePairwiseOnDemand]: 378/399 looper letters, 2237 selfloop transitions, 734 changer transitions 59/3031 dead transitions. [2023-01-27 22:48:58,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 3031 transitions, 67242 flow [2023-01-27 22:48:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-27 22:48:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-01-27 22:48:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5273 transitions. [2023-01-27 22:48:58,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2936786410470621 [2023-01-27 22:48:58,454 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 5273 transitions. [2023-01-27 22:48:58,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 5273 transitions. [2023-01-27 22:48:58,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:58,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 5273 transitions. [2023-01-27 22:48:58,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 117.17777777777778) internal successors, (5273), 45 states have internal predecessors, (5273), 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-27 22:48:58,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 399.0) internal successors, (18354), 46 states have internal predecessors, (18354), 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-27 22:48:58,468 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 399.0) internal successors, (18354), 46 states have internal predecessors, (18354), 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-27 22:48:58,468 INFO L175 Difference]: Start difference. First operand has 274 places, 1988 transitions, 41091 flow. Second operand 45 states and 5273 transitions. [2023-01-27 22:48:58,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 3031 transitions, 67242 flow [2023-01-27 22:49:57,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 3031 transitions, 65544 flow, removed 65 selfloop flow, removed 9 redundant places. [2023-01-27 22:49:57,774 INFO L231 Difference]: Finished difference. Result has 328 places, 2631 transitions, 56339 flow [2023-01-27 22:49:57,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=39826, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=56339, PETRI_PLACES=328, PETRI_TRANSITIONS=2631} [2023-01-27 22:49:57,776 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 296 predicate places. [2023-01-27 22:49:57,776 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 2631 transitions, 56339 flow [2023-01-27 22:49:57,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 111.21052631578948) internal successors, (4226), 38 states have internal predecessors, (4226), 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-27 22:49:57,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:57,777 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, 1, 1] [2023-01-27 22:49:57,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 22:49:57,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 22:49:57,982 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:57,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1435828496, now seen corresponding path program 2 times [2023-01-27 22:49:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39304205] [2023-01-27 22:49:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39304205] [2023-01-27 22:49:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39304205] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826172680] [2023-01-27 22:49:59,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:49:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:59,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:59,260 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:49:59,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 22:49:59,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:49:59,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:59,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-27 22:49:59,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:50:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:50:00,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:50:06,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:50:06,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 264 [2023-01-27 22:50:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:50:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826172680] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:50:17,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:50:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 36 [2023-01-27 22:50:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489063294] [2023-01-27 22:50:17,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:50:17,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:50:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:50:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:50:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1245, Unknown=2, NotChecked=0, Total=1406 [2023-01-27 22:50:17,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 399 [2023-01-27 22:50:17,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 2631 transitions, 56339 flow. Second operand has 38 states, 38 states have (on average 111.15789473684211) internal successors, (4224), 38 states have internal predecessors, (4224), 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-27 22:50:17,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:50:17,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 399 [2023-01-27 22:50:17,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:50:55,596 WARN L222 SmtUtils]: Spent 36.86s on a formula simplification. DAG size of input: 148 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:50:57,811 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-27 22:50:59,826 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-27 22:51:01,847 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-27 22:51:03,850 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-27 22:51:58,223 WARN L222 SmtUtils]: Spent 54.29s on a formula simplification. DAG size of input: 68 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:52:00,307 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-27 22:52:02,349 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-27 22:52:25,202 WARN L222 SmtUtils]: Spent 22.77s on a formula simplification. DAG size of input: 102 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:52:33,968 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-27 22:52:35,971 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-27 22:52:38,000 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-27 22:52:52,129 WARN L222 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:52:57,597 WARN L222 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 132 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:52:59,617 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-27 22:53:01,680 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-27 22:53:11,972 WARN L222 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:53:14,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:53:20,678 WARN L222 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 94 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:53:21,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:53:23,720 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-27 22:53:48,054 WARN L222 SmtUtils]: Spent 20.19s on a formula simplification. DAG size of input: 59 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:53:59,337 WARN L222 SmtUtils]: Spent 10.26s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:54:01,343 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-27 22:54:17,962 WARN L222 SmtUtils]: Spent 10.32s on a formula simplification. DAG size of input: 94 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:54:19,976 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-27 22:54:21,987 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-27 22:54:23,989 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-27 22:54:25,991 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-27 22:54:28,000 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-27 22:54:34,345 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-27 22:54:36,348 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-27 22:54:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:54:41,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:54:44,096 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-27 22:54:54,397 WARN L222 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 86 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:54:56,411 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-27 22:55:05,035 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-27 22:55:07,117 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-27 22:55:11,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:55:43,246 WARN L222 SmtUtils]: Spent 24.83s on a formula simplification. DAG size of input: 161 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:55:49,849 WARN L222 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 133 DAG size of output: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:55:52,326 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-27 22:55:54,356 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-27 22:55:56,366 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-27 22:55:58,373 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-27 22:56:00,424 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-27 22:56:02,500 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-27 22:56:04,587 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-27 22:56:06,857 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] Received shutdown request... [2023-01-27 22:56:58,484 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-27 22:56:58,494 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:56:59,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-27 22:56:59,685 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-27 22:56:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-01-27 22:56:59,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 22:56:59,765 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.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.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-27 22:56:59,799 INFO L158 Benchmark]: Toolchain (without parser) took 841435.01ms. Allocated memory was 375.4MB in the beginning and 12.6GB in the end (delta: 12.2GB). Free memory was 318.6MB in the beginning and 10.0GB in the end (delta: -9.7GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 22:56:59,799 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 323.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:56:59,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.44ms. Allocated memory is still 375.4MB. Free memory was 318.3MB in the beginning and 306.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 22:56:59,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.49ms. Allocated memory is still 375.4MB. Free memory was 306.3MB in the beginning and 304.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:56:59,800 INFO L158 Benchmark]: Boogie Preprocessor took 24.69ms. Allocated memory is still 375.4MB. Free memory was 304.0MB in the beginning and 302.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:56:59,800 INFO L158 Benchmark]: RCFGBuilder took 570.84ms. Allocated memory was 375.4MB in the beginning and 639.6MB in the end (delta: 264.2MB). Free memory was 302.2MB in the beginning and 585.1MB in the end (delta: -282.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.0GB. [2023-01-27 22:56:59,800 INFO L158 Benchmark]: TraceAbstraction took 840640.58ms. Allocated memory was 639.6MB in the beginning and 12.6GB in the end (delta: 11.9GB). Free memory was 584.0MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 22:56:59,801 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-01-27 22:56:59,797 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 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 323.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 167.44ms. Allocated memory is still 375.4MB. Free memory was 318.3MB in the beginning and 306.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.49ms. Allocated memory is still 375.4MB. Free memory was 306.3MB in the beginning and 304.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.69ms. Allocated memory is still 375.4MB. Free memory was 304.0MB in the beginning and 302.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 570.84ms. Allocated memory was 375.4MB in the beginning and 639.6MB in the end (delta: 264.2MB). Free memory was 302.2MB in the beginning and 585.1MB in the end (delta: -282.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.0GB. * TraceAbstraction took 840640.58ms. Allocated memory was 639.6MB in the beginning and 12.6GB in the end (delta: 11.9GB). Free memory was 584.0MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 180 PlacesBefore, 32 PlacesAfterwards, 188 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 8 FixpointIterations, 122 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 12 ConcurrentYvCompositions, 12 ChoiceCompositions, 198 TotalNumberOfCompositions, 2338 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1811, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 837, independent: 816, independent conditional: 0, independent unconditional: 816, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1811, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 837, unknown conditional: 0, unknown unconditional: 837] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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