/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 16:01:29,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 16:01:29,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 16:01:29,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 16:01:29,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 16:01:29,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 16:01:29,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 16:01:29,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 16:01:29,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 16:01:29,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 16:01:29,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 16:01:29,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 16:01:29,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 16:01:29,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 16:01:29,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 16:01:29,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 16:01:29,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 16:01:29,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 16:01:29,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 16:01:29,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 16:01:29,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 16:01:29,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 16:01:29,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 16:01:29,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 16:01:29,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 16:01:29,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 16:01:29,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 16:01:29,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 16:01:29,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 16:01:29,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 16:01:29,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 16:01:29,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 16:01:29,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 16:01:29,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 16:01:29,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 16:01:29,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 16:01:29,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 16:01:29,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 16:01:29,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 16:01:29,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 16:01:29,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 16:01:29,397 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-SemanticLbe.epf [2022-12-12 16:01:29,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 16:01:29,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 16:01:29,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 16:01:29,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 16:01:29,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 16:01:29,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 16:01:29,421 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 16:01:29,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 16:01:29,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 16:01:29,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 16:01:29,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 16:01:29,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 16:01:29,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 16:01:29,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 16:01:29,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:01:29,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 16:01:29,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 16:01:29,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 16:01:29,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 16:01:29,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 16:01:29,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 16:01:29,681 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 16:01:29,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-12-12 16:01:30,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 16:01:30,793 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 16:01:30,794 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-12-12 16:01:30,799 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb69831fd/79e806ee0b5a43ae96ff151d09fc64e0/FLAG279fda8cb [2022-12-12 16:01:30,813 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb69831fd/79e806ee0b5a43ae96ff151d09fc64e0 [2022-12-12 16:01:30,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 16:01:30,816 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 16:01:30,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 16:01:30,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 16:01:30,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 16:01:30,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:01:30" (1/1) ... [2022-12-12 16:01:30,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dae82a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:30, skipping insertion in model container [2022-12-12 16:01:30,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:01:30" (1/1) ... [2022-12-12 16:01:30,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 16:01:30,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 16:01:30,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:30,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:30,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:30,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:30,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:30,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:31,001 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-12-12 16:01:31,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:01:31,022 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 16:01:31,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:31,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:31,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:31,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:31,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:01:31,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:01:31,050 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-12-12 16:01:31,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:01:31,069 INFO L208 MainTranslator]: Completed translation [2022-12-12 16:01:31,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31 WrapperNode [2022-12-12 16:01:31,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 16:01:31,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 16:01:31,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 16:01:31,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 16:01:31,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,124 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 271 [2022-12-12 16:01:31,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 16:01:31,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 16:01:31,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 16:01:31,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 16:01:31,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 16:01:31,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 16:01:31,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 16:01:31,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 16:01:31,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (1/1) ... [2022-12-12 16:01:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:01:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:31,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 16:01:31,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 16:01:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 16:01:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 16:01:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 16:01:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 16:01:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 16:01:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 16:01:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 16:01:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 16:01:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 16:01:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 16:01:31,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 16:01:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 16:01:31,257 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 16:01:31,348 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 16:01:31,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 16:01:31,745 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 16:01:31,950 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 16:01:31,950 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-12 16:01:31,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:01:31 BoogieIcfgContainer [2022-12-12 16:01:31,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 16:01:31,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 16:01:31,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 16:01:31,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 16:01:31,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 04:01:30" (1/3) ... [2022-12-12 16:01:31,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281737ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:01:31, skipping insertion in model container [2022-12-12 16:01:31,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:01:31" (2/3) ... [2022-12-12 16:01:31,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281737ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:01:31, skipping insertion in model container [2022-12-12 16:01:31,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:01:31" (3/3) ... [2022-12-12 16:01:31,960 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-12-12 16:01:31,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 16:01:31,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 16:01:31,973 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 16:01:32,022 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 16:01:32,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 176 transitions, 376 flow [2022-12-12 16:01:32,118 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-12-12 16:01:32,119 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:01:32,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 16/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2022-12-12 16:01:32,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 176 transitions, 376 flow [2022-12-12 16:01:32,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 163 transitions, 344 flow [2022-12-12 16:01:32,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 16:01:32,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 163 transitions, 344 flow [2022-12-12 16:01:32,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 344 flow [2022-12-12 16:01:32,182 INFO L130 PetriNetUnfolder]: 16/163 cut-off events. [2022-12-12 16:01:32,182 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:01:32,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 16/163 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 104 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2022-12-12 16:01:32,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 163 transitions, 344 flow [2022-12-12 16:01:32,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-12 16:01:38,079 INFO L241 LiptonReduction]: Total number of compositions: 137 [2022-12-12 16:01:38,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 16:01:38,100 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;@4e8b6925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 16:01:38,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 16:01:38,106 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-12 16:01:38,107 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:01:38,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:38,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:38,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 902596479, now seen corresponding path program 1 times [2022-12-12 16:01:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:38,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360608772] [2022-12-12 16:01:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:38,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360608772] [2022-12-12 16:01:38,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360608772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:01:38,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:01:38,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 16:01:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85524480] [2022-12-12 16:01:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:01:38,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 16:01:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 16:01:38,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 16:01:38,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-12 16:01:38,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:38,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:38,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-12 16:01:38,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:38,678 INFO L130 PetriNetUnfolder]: 361/510 cut-off events. [2022-12-12 16:01:38,678 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-12 16:01:38,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 510 events. 361/510 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1620 event pairs, 39 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-12 16:01:38,682 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 34 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2022-12-12 16:01:38,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 195 flow [2022-12-12 16:01:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 16:01:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 16:01:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-12 16:01:38,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-12 16:01:38,692 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 70 flow. Second operand 3 states and 49 transitions. [2022-12-12 16:01:38,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 195 flow [2022-12-12 16:01:38,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-12 16:01:38,696 INFO L231 Difference]: Finished difference. Result has 28 places, 29 transitions, 84 flow [2022-12-12 16:01:38,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=28, PETRI_TRANSITIONS=29} [2022-12-12 16:01:38,700 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2022-12-12 16:01:38,700 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 29 transitions, 84 flow [2022-12-12 16:01:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:38,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:38,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:38,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 16:01:38,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1958732551, now seen corresponding path program 1 times [2022-12-12 16:01:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:38,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147875586] [2022-12-12 16:01:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:38,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147875586] [2022-12-12 16:01:38,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147875586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:01:38,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:01:38,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 16:01:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680461774] [2022-12-12 16:01:38,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:01:38,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:01:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:01:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 16:01:38,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:01:38,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:38,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:38,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:01:38,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:38,989 INFO L130 PetriNetUnfolder]: 362/524 cut-off events. [2022-12-12 16:01:38,989 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-12 16:01:38,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 524 events. 362/524 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1736 event pairs, 121 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 488. Up to 370 conditions per place. [2022-12-12 16:01:38,992 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 35 selfloop transitions, 5 changer transitions 2/44 dead transitions. [2022-12-12 16:01:38,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 210 flow [2022-12-12 16:01:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 16:01:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 16:01:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-12 16:01:38,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2022-12-12 16:01:38,994 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 84 flow. Second operand 5 states and 49 transitions. [2022-12-12 16:01:38,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 210 flow [2022-12-12 16:01:38,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 16:01:38,995 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 106 flow [2022-12-12 16:01:38,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2022-12-12 16:01:38,995 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2022-12-12 16:01:38,996 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 106 flow [2022-12-12 16:01:38,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:38,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:38,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:38,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 16:01:38,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 514477029, now seen corresponding path program 1 times [2022-12-12 16:01:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:38,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462153947] [2022-12-12 16:01:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:39,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462153947] [2022-12-12 16:01:39,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462153947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:39,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559643303] [2022-12-12 16:01:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:39,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:39,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 16:01:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:39,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:01:39,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:39,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:39,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559643303] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:39,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 16:01:39,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-12-12 16:01:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356842246] [2022-12-12 16:01:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:01:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 16:01:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 16:01:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-12 16:01:39,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:01:39,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:39,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:39,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:01:39,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:39,580 INFO L130 PetriNetUnfolder]: 405/589 cut-off events. [2022-12-12 16:01:39,580 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-12 16:01:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 589 events. 405/589 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2036 event pairs, 29 based on Foata normal form. 44/633 useless extension candidates. Maximal degree in co-relation 1409. Up to 332 conditions per place. [2022-12-12 16:01:39,583 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 51 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2022-12-12 16:01:39,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 63 transitions, 325 flow [2022-12-12 16:01:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 16:01:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 16:01:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-12-12 16:01:39,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2022-12-12 16:01:39,584 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 106 flow. Second operand 8 states and 63 transitions. [2022-12-12 16:01:39,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 63 transitions, 325 flow [2022-12-12 16:01:39,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 321 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-12 16:01:39,586 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 156 flow [2022-12-12 16:01:39,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=156, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-12-12 16:01:39,587 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2022-12-12 16:01:39,587 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 156 flow [2022-12-12 16:01:39,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:39,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:39,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:39,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 16:01:39,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:39,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash -960270151, now seen corresponding path program 1 times [2022-12-12 16:01:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:39,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206821695] [2022-12-12 16:01:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:39,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206821695] [2022-12-12 16:01:39,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206821695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:39,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409277707] [2022-12-12 16:01:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:39,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:39,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:39,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 16:01:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:39,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 16:01:39,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:40,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409277707] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:40,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 16:01:40,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-12 16:01:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615993610] [2022-12-12 16:01:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:01:40,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:01:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:01:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-12 16:01:40,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:01:40,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:40,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:40,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:01:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:40,125 INFO L130 PetriNetUnfolder]: 314/469 cut-off events. [2022-12-12 16:01:40,125 INFO L131 PetriNetUnfolder]: For 432/477 co-relation queries the response was YES. [2022-12-12 16:01:40,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 469 events. 314/469 cut-off events. For 432/477 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1523 event pairs, 78 based on Foata normal form. 59/512 useless extension candidates. Maximal degree in co-relation 1368. Up to 353 conditions per place. [2022-12-12 16:01:40,128 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-12 16:01:40,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 311 flow [2022-12-12 16:01:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 16:01:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 16:01:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-12 16:01:40,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2022-12-12 16:01:40,129 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 156 flow. Second operand 5 states and 46 transitions. [2022-12-12 16:01:40,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 311 flow [2022-12-12 16:01:40,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 292 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-12 16:01:40,131 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 164 flow [2022-12-12 16:01:40,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-12 16:01:40,132 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2022-12-12 16:01:40,132 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 164 flow [2022-12-12 16:01:40,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:40,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:40,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:40,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 16:01:40,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-12 16:01:40,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:40,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1511593591, now seen corresponding path program 1 times [2022-12-12 16:01:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:40,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727902196] [2022-12-12 16:01:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:41,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727902196] [2022-12-12 16:01:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727902196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232911793] [2022-12-12 16:01:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:41,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:41,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 16:01:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:41,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 16:01:41,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:42,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:42,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:42,247 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-12 16:01:42,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-12 16:01:42,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:42,357 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-12 16:01:42,357 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 31 treesize of output 25 [2022-12-12 16:01:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:42,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:42,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_~M~0))) (let ((.cse1 (+ .cse4 c_~B~0.offset)) (.cse2 (+ c_~A~0.offset .cse4))) (and (forall ((v_ArrVal_201 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (+ (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2) c_~res2~0)) (+ c_~res1~0 1))) (forall ((v_ArrVal_201 (Array Int Int))) (<= c_~res1~0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (+ (select (select .cse3 c_~B~0.base) .cse1) (select (select .cse3 c_~A~0.base) .cse2) c_~res2~0))))))) is different from false [2022-12-12 16:01:42,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:42,547 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 186 treesize of output 174 [2022-12-12 16:01:42,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:42,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 74 [2022-12-12 16:01:42,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:42,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:43,002 INFO L321 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2022-12-12 16:01:43,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 38 [2022-12-12 16:01:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-12 16:01:43,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232911793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:01:43,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:01:43,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 30 [2022-12-12 16:01:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494402025] [2022-12-12 16:01:43,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:01:43,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 16:01:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 16:01:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=815, Unknown=1, NotChecked=58, Total=992 [2022-12-12 16:01:43,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:01:43,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 164 flow. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:43,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:43,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:01:43,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:45,572 INFO L130 PetriNetUnfolder]: 1126/1660 cut-off events. [2022-12-12 16:01:45,572 INFO L131 PetriNetUnfolder]: For 1753/1753 co-relation queries the response was YES. [2022-12-12 16:01:45,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 1660 events. 1126/1660 cut-off events. For 1753/1753 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6530 event pairs, 136 based on Foata normal form. 20/1675 useless extension candidates. Maximal degree in co-relation 4097. Up to 733 conditions per place. [2022-12-12 16:01:45,580 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 154 selfloop transitions, 76 changer transitions 4/234 dead transitions. [2022-12-12 16:01:45,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 234 transitions, 1386 flow [2022-12-12 16:01:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-12 16:01:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-12 16:01:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 204 transitions. [2022-12-12 16:01:45,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-12 16:01:45,585 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 164 flow. Second operand 24 states and 204 transitions. [2022-12-12 16:01:45,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 234 transitions, 1386 flow [2022-12-12 16:01:45,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 234 transitions, 1353 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-12 16:01:45,596 INFO L231 Difference]: Finished difference. Result has 71 places, 107 transitions, 749 flow [2022-12-12 16:01:45,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=749, PETRI_PLACES=71, PETRI_TRANSITIONS=107} [2022-12-12 16:01:45,598 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2022-12-12 16:01:45,598 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 107 transitions, 749 flow [2022-12-12 16:01:45,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:45,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:45,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:45,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 16:01:45,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:45,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1527873321, now seen corresponding path program 2 times [2022-12-12 16:01:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:45,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853363265] [2022-12-12 16:01:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:46,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853363265] [2022-12-12 16:01:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853363265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:46,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417978786] [2022-12-12 16:01:46,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:01:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:46,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:46,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 16:01:46,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:01:46,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:01:46,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 16:01:46,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:47,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:47,131 INFO L321 Elim1Store]: treesize reduction 47, result has 30.9 percent of original size [2022-12-12 16:01:47,132 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 33 treesize of output 31 [2022-12-12 16:01:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:47,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:47,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:47,242 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 41 treesize of output 94 [2022-12-12 16:01:47,353 INFO L321 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2022-12-12 16:01:47,354 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 42 treesize of output 30 [2022-12-12 16:01:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:47,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417978786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:01:47,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:01:47,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2022-12-12 16:01:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810832741] [2022-12-12 16:01:47,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:01:47,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 16:01:47,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 16:01:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-12-12 16:01:47,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:01:47,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 107 transitions, 749 flow. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:47,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:47,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:01:47,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:50,466 INFO L130 PetriNetUnfolder]: 1467/2180 cut-off events. [2022-12-12 16:01:50,466 INFO L131 PetriNetUnfolder]: For 6328/6328 co-relation queries the response was YES. [2022-12-12 16:01:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8889 conditions, 2180 events. 1467/2180 cut-off events. For 6328/6328 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9132 event pairs, 206 based on Foata normal form. 57/2231 useless extension candidates. Maximal degree in co-relation 8186. Up to 1289 conditions per place. [2022-12-12 16:01:50,479 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 151 selfloop transitions, 144 changer transitions 1/296 dead transitions. [2022-12-12 16:01:50,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 296 transitions, 2388 flow [2022-12-12 16:01:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-12 16:01:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-12 16:01:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 228 transitions. [2022-12-12 16:01:50,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22485207100591717 [2022-12-12 16:01:50,481 INFO L175 Difference]: Start difference. First operand has 71 places, 107 transitions, 749 flow. Second operand 39 states and 228 transitions. [2022-12-12 16:01:50,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 296 transitions, 2388 flow [2022-12-12 16:01:50,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 296 transitions, 2310 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-12-12 16:01:50,499 INFO L231 Difference]: Finished difference. Result has 123 places, 202 transitions, 1905 flow [2022-12-12 16:01:50,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1905, PETRI_PLACES=123, PETRI_TRANSITIONS=202} [2022-12-12 16:01:50,501 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 92 predicate places. [2022-12-12 16:01:50,501 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 202 transitions, 1905 flow [2022-12-12 16:01:50,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:50,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:50,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:50,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 16:01:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:50,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1351432649, now seen corresponding path program 3 times [2022-12-12 16:01:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:50,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457343946] [2022-12-12 16:01:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:51,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457343946] [2022-12-12 16:01:51,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457343946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:51,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738267723] [2022-12-12 16:01:51,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:01:51,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:51,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:51,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:51,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 16:01:51,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:01:51,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:01:51,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-12 16:01:51,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:51,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:52,008 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-12 16:01:52,009 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 31 treesize of output 25 [2022-12-12 16:01:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:52,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:52,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:52,119 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 41 treesize of output 94 [2022-12-12 16:01:52,225 INFO L321 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2022-12-12 16:01:52,226 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 42 treesize of output 30 [2022-12-12 16:01:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738267723] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:01:52,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:01:52,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2022-12-12 16:01:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039384171] [2022-12-12 16:01:52,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:01:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 16:01:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 16:01:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-12-12 16:01:52,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:01:52,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 202 transitions, 1905 flow. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:52,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:52,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:01:52,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:54,018 INFO L130 PetriNetUnfolder]: 1574/2372 cut-off events. [2022-12-12 16:01:54,018 INFO L131 PetriNetUnfolder]: For 10146/10155 co-relation queries the response was YES. [2022-12-12 16:01:54,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11364 conditions, 2372 events. 1574/2372 cut-off events. For 10146/10155 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10830 event pairs, 223 based on Foata normal form. 8/2354 useless extension candidates. Maximal degree in co-relation 10763. Up to 1577 conditions per place. [2022-12-12 16:01:54,033 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 156 selfloop transitions, 129 changer transitions 1/307 dead transitions. [2022-12-12 16:01:54,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 307 transitions, 3038 flow [2022-12-12 16:01:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-12 16:01:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-12 16:01:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 174 transitions. [2022-12-12 16:01:54,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2909698996655518 [2022-12-12 16:01:54,035 INFO L175 Difference]: Start difference. First operand has 123 places, 202 transitions, 1905 flow. Second operand 23 states and 174 transitions. [2022-12-12 16:01:54,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 307 transitions, 3038 flow [2022-12-12 16:01:54,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 307 transitions, 2779 flow, removed 77 selfloop flow, removed 8 redundant places. [2022-12-12 16:01:54,068 INFO L231 Difference]: Finished difference. Result has 143 places, 234 transitions, 2361 flow [2022-12-12 16:01:54,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2361, PETRI_PLACES=143, PETRI_TRANSITIONS=234} [2022-12-12 16:01:54,069 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 112 predicate places. [2022-12-12 16:01:54,069 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 234 transitions, 2361 flow [2022-12-12 16:01:54,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:54,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:54,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:54,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 16:01:54,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:54,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1457569653, now seen corresponding path program 4 times [2022-12-12 16:01:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:54,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407794302] [2022-12-12 16:01:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407794302] [2022-12-12 16:01:55,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407794302] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964781790] [2022-12-12 16:01:55,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:01:55,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:55,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:55,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:55,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 16:01:55,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:01:55,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:01:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-12 16:01:55,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:55,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:55,435 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-12 16:01:55,435 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 31 treesize of output 25 [2022-12-12 16:01:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:55,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:55,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:55,527 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 33 treesize of output 82 [2022-12-12 16:01:55,678 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-12-12 16:01:55,678 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 34 treesize of output 30 [2022-12-12 16:01:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:01:55,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964781790] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:01:55,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:01:55,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 26 [2022-12-12 16:01:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825649971] [2022-12-12 16:01:55,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:01:55,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 16:01:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:01:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 16:01:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-12-12 16:01:55,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:01:55,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 234 transitions, 2361 flow. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:55,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:01:55,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:01:55,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:01:57,366 INFO L130 PetriNetUnfolder]: 2198/3255 cut-off events. [2022-12-12 16:01:57,366 INFO L131 PetriNetUnfolder]: For 20571/20571 co-relation queries the response was YES. [2022-12-12 16:01:57,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17642 conditions, 3255 events. 2198/3255 cut-off events. For 20571/20571 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14841 event pairs, 265 based on Foata normal form. 2/3257 useless extension candidates. Maximal degree in co-relation 16852. Up to 1899 conditions per place. [2022-12-12 16:01:57,404 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 186 selfloop transitions, 192 changer transitions 2/380 dead transitions. [2022-12-12 16:01:57,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 380 transitions, 4239 flow [2022-12-12 16:01:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-12 16:01:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-12 16:01:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 186 transitions. [2022-12-12 16:01:57,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27514792899408286 [2022-12-12 16:01:57,407 INFO L175 Difference]: Start difference. First operand has 143 places, 234 transitions, 2361 flow. Second operand 26 states and 186 transitions. [2022-12-12 16:01:57,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 380 transitions, 4239 flow [2022-12-12 16:01:57,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 380 transitions, 4122 flow, removed 38 selfloop flow, removed 9 redundant places. [2022-12-12 16:01:57,460 INFO L231 Difference]: Finished difference. Result has 166 places, 286 transitions, 3330 flow [2022-12-12 16:01:57,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3330, PETRI_PLACES=166, PETRI_TRANSITIONS=286} [2022-12-12 16:01:57,462 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2022-12-12 16:01:57,462 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 286 transitions, 3330 flow [2022-12-12 16:01:57,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:01:57,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:01:57,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:01:57,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 16:01:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:57,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:01:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:01:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1327420141, now seen corresponding path program 5 times [2022-12-12 16:01:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:01:57,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134730197] [2022-12-12 16:01:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:01:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:01:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:01:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:01:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:01:58,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134730197] [2022-12-12 16:01:58,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134730197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:01:58,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72733973] [2022-12-12 16:01:58,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:01:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:01:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:01:58,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:01:58,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 16:01:58,808 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:01:58,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:01:58,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-12 16:01:58,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:01:58,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:58,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:58,845 INFO L321 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2022-12-12 16:01:58,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 35 [2022-12-12 16:01:58,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:58,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:58,940 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 16:01:58,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-12-12 16:01:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:59,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:59,257 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-12 16:01:59,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-12 16:01:59,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:59,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:01:59,354 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-12 16:01:59,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-12 16:01:59,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:01:59,468 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-12 16:01:59,468 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 31 treesize of output 25 [2022-12-12 16:01:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:01:59,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:01:59,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:59,846 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 1526 treesize of output 970 [2022-12-12 16:01:59,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:59,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 798 [2022-12-12 16:01:59,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:01:59,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 790 treesize of output 606 [2022-12-12 16:02:07,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:02:07,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:02:07,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:02:07,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:02:07,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:07,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:07,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:02:07,127 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 17 [2022-12-12 16:02:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:02:07,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72733973] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:07,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:07,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-12-12 16:02:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391203129] [2022-12-12 16:02:07,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:07,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 16:02:07,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 16:02:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=879, Unknown=7, NotChecked=0, Total=992 [2022-12-12 16:02:07,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:07,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 286 transitions, 3330 flow. Second operand has 32 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:07,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:07,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:07,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:10,889 INFO L130 PetriNetUnfolder]: 2356/3638 cut-off events. [2022-12-12 16:02:10,889 INFO L131 PetriNetUnfolder]: For 23000/23012 co-relation queries the response was YES. [2022-12-12 16:02:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20776 conditions, 3638 events. 2356/3638 cut-off events. For 23000/23012 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19010 event pairs, 155 based on Foata normal form. 14/3617 useless extension candidates. Maximal degree in co-relation 20228. Up to 1847 conditions per place. [2022-12-12 16:02:10,921 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 208 selfloop transitions, 199 changer transitions 11/439 dead transitions. [2022-12-12 16:02:10,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 439 transitions, 5147 flow [2022-12-12 16:02:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-12 16:02:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-12 16:02:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 198 transitions. [2022-12-12 16:02:10,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3311036789297659 [2022-12-12 16:02:10,923 INFO L175 Difference]: Start difference. First operand has 166 places, 286 transitions, 3330 flow. Second operand 23 states and 198 transitions. [2022-12-12 16:02:10,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 439 transitions, 5147 flow [2022-12-12 16:02:10,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 439 transitions, 4760 flow, removed 124 selfloop flow, removed 11 redundant places. [2022-12-12 16:02:11,000 INFO L231 Difference]: Finished difference. Result has 185 places, 343 transitions, 4302 flow [2022-12-12 16:02:11,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=3015, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4302, PETRI_PLACES=185, PETRI_TRANSITIONS=343} [2022-12-12 16:02:11,002 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2022-12-12 16:02:11,002 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 343 transitions, 4302 flow [2022-12-12 16:02:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:11,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:11,002 INFO L214 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] [2022-12-12 16:02:11,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:11,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:11,209 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 99404134, now seen corresponding path program 6 times [2022-12-12 16:02:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648301648] [2022-12-12 16:02:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648301648] [2022-12-12 16:02:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648301648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212564786] [2022-12-12 16:02:11,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 16:02:11,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:11,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:11,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:11,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 16:02:11,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-12 16:02:11,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:11,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:11,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:11,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:11,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212564786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:11,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:11,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-12-12 16:02:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093507770] [2022-12-12 16:02:11,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:11,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 16:02:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 16:02:11,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-12-12 16:02:11,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:11,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 343 transitions, 4302 flow. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:11,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:11,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:11,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:13,266 INFO L130 PetriNetUnfolder]: 5161/7906 cut-off events. [2022-12-12 16:02:13,267 INFO L131 PetriNetUnfolder]: For 82337/82491 co-relation queries the response was YES. [2022-12-12 16:02:13,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48324 conditions, 7906 events. 5161/7906 cut-off events. For 82337/82491 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 46158 event pairs, 1280 based on Foata normal form. 149/8030 useless extension candidates. Maximal degree in co-relation 48268. Up to 2705 conditions per place. [2022-12-12 16:02:13,328 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 498 selfloop transitions, 184 changer transitions 0/698 dead transitions. [2022-12-12 16:02:13,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 698 transitions, 9469 flow [2022-12-12 16:02:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-12 16:02:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-12 16:02:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 179 transitions. [2022-12-12 16:02:13,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38247863247863245 [2022-12-12 16:02:13,329 INFO L175 Difference]: Start difference. First operand has 185 places, 343 transitions, 4302 flow. Second operand 18 states and 179 transitions. [2022-12-12 16:02:13,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 698 transitions, 9469 flow [2022-12-12 16:02:13,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 698 transitions, 8926 flow, removed 170 selfloop flow, removed 23 redundant places. [2022-12-12 16:02:13,572 INFO L231 Difference]: Finished difference. Result has 178 places, 413 transitions, 5676 flow [2022-12-12 16:02:13,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=3211, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5676, PETRI_PLACES=178, PETRI_TRANSITIONS=413} [2022-12-12 16:02:13,574 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2022-12-12 16:02:13,574 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 413 transitions, 5676 flow [2022-12-12 16:02:13,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:13,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:13,574 INFO L214 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] [2022-12-12 16:02:13,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-12 16:02:13,779 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,SelfDestructingSolverStorable9 [2022-12-12 16:02:13,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash 973957045, now seen corresponding path program 7 times [2022-12-12 16:02:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:13,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397693970] [2022-12-12 16:02:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397693970] [2022-12-12 16:02:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397693970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446268349] [2022-12-12 16:02:13,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 16:02:13,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:13,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:13,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 16:02:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:13,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:02:13,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:14,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:14,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446268349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:14,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:14,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-12 16:02:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980939837] [2022-12-12 16:02:14,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 16:02:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 16:02:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-12 16:02:14,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:02:14,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 413 transitions, 5676 flow. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:14,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:14,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:02:14,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:15,568 INFO L130 PetriNetUnfolder]: 4666/7497 cut-off events. [2022-12-12 16:02:15,568 INFO L131 PetriNetUnfolder]: For 115886/116490 co-relation queries the response was YES. [2022-12-12 16:02:15,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51594 conditions, 7497 events. 4666/7497 cut-off events. For 115886/116490 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 48333 event pairs, 1136 based on Foata normal form. 718/7970 useless extension candidates. Maximal degree in co-relation 51536. Up to 2941 conditions per place. [2022-12-12 16:02:15,625 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 456 selfloop transitions, 78 changer transitions 8/586 dead transitions. [2022-12-12 16:02:15,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 586 transitions, 8830 flow [2022-12-12 16:02:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 16:02:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 16:02:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2022-12-12 16:02:15,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-12 16:02:15,626 INFO L175 Difference]: Start difference. First operand has 178 places, 413 transitions, 5676 flow. Second operand 12 states and 143 transitions. [2022-12-12 16:02:15,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 586 transitions, 8830 flow [2022-12-12 16:02:15,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 586 transitions, 8335 flow, removed 243 selfloop flow, removed 4 redundant places. [2022-12-12 16:02:15,980 INFO L231 Difference]: Finished difference. Result has 188 places, 400 transitions, 5383 flow [2022-12-12 16:02:15,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5009, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5383, PETRI_PLACES=188, PETRI_TRANSITIONS=400} [2022-12-12 16:02:15,981 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2022-12-12 16:02:15,981 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 400 transitions, 5383 flow [2022-12-12 16:02:15,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:15,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:15,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:02:15,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-12 16:02:16,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:16,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1243815832, now seen corresponding path program 1 times [2022-12-12 16:02:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803670625] [2022-12-12 16:02:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:02:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:16,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803670625] [2022-12-12 16:02:16,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803670625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:16,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854890526] [2022-12-12 16:02:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:16,293 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) [2022-12-12 16:02:16,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 16:02:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:16,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 16:02:16,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:02:16,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:02:16,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854890526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:16,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:16,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-12 16:02:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528199695] [2022-12-12 16:02:16,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:16,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 16:02:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 16:02:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-12 16:02:16,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:16,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 400 transitions, 5383 flow. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:16,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:16,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:16,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:18,467 INFO L130 PetriNetUnfolder]: 5061/8101 cut-off events. [2022-12-12 16:02:18,467 INFO L131 PetriNetUnfolder]: For 101154/101302 co-relation queries the response was YES. [2022-12-12 16:02:18,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54119 conditions, 8101 events. 5061/8101 cut-off events. For 101154/101302 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 51225 event pairs, 672 based on Foata normal form. 108/8183 useless extension candidates. Maximal degree in co-relation 54059. Up to 1899 conditions per place. [2022-12-12 16:02:18,543 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 465 selfloop transitions, 184 changer transitions 27/697 dead transitions. [2022-12-12 16:02:18,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 697 transitions, 9811 flow [2022-12-12 16:02:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 16:02:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 16:02:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 223 transitions. [2022-12-12 16:02:18,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4288461538461538 [2022-12-12 16:02:18,638 INFO L175 Difference]: Start difference. First operand has 188 places, 400 transitions, 5383 flow. Second operand 20 states and 223 transitions. [2022-12-12 16:02:18,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 697 transitions, 9811 flow [2022-12-12 16:02:19,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 697 transitions, 9786 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-12 16:02:19,043 INFO L231 Difference]: Finished difference. Result has 213 places, 483 transitions, 7281 flow [2022-12-12 16:02:19,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5370, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7281, PETRI_PLACES=213, PETRI_TRANSITIONS=483} [2022-12-12 16:02:19,043 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2022-12-12 16:02:19,043 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 483 transitions, 7281 flow [2022-12-12 16:02:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:19,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:19,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:02:19,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:19,249 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,SelfDestructingSolverStorable11 [2022-12-12 16:02:19,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1341052756, now seen corresponding path program 2 times [2022-12-12 16:02:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:19,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891954590] [2022-12-12 16:02:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:19,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891954590] [2022-12-12 16:02:19,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891954590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:19,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830461634] [2022-12-12 16:02:19,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:02:19,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:19,364 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) [2022-12-12 16:02:19,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 16:02:19,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:02:19,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:19,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 16:02:19,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:19,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:19,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830461634] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:19,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:19,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-12 16:02:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620422614] [2022-12-12 16:02:19,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 16:02:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 16:02:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-12 16:02:19,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:19,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 483 transitions, 7281 flow. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:19,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:19,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:19,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:21,086 INFO L130 PetriNetUnfolder]: 3883/6559 cut-off events. [2022-12-12 16:02:21,086 INFO L131 PetriNetUnfolder]: For 108908/109058 co-relation queries the response was YES. [2022-12-12 16:02:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45011 conditions, 6559 events. 3883/6559 cut-off events. For 108908/109058 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 43197 event pairs, 562 based on Foata normal form. 620/7153 useless extension candidates. Maximal degree in co-relation 44941. Up to 2365 conditions per place. [2022-12-12 16:02:21,140 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 328 selfloop transitions, 48 changer transitions 114/509 dead transitions. [2022-12-12 16:02:21,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 509 transitions, 7617 flow [2022-12-12 16:02:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 16:02:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 16:02:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 149 transitions. [2022-12-12 16:02:21,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3581730769230769 [2022-12-12 16:02:21,141 INFO L175 Difference]: Start difference. First operand has 213 places, 483 transitions, 7281 flow. Second operand 16 states and 149 transitions. [2022-12-12 16:02:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 509 transitions, 7617 flow [2022-12-12 16:02:21,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 509 transitions, 7420 flow, removed 93 selfloop flow, removed 5 redundant places. [2022-12-12 16:02:21,570 INFO L231 Difference]: Finished difference. Result has 218 places, 290 transitions, 4163 flow [2022-12-12 16:02:21,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5191, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4163, PETRI_PLACES=218, PETRI_TRANSITIONS=290} [2022-12-12 16:02:21,570 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2022-12-12 16:02:21,571 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 290 transitions, 4163 flow [2022-12-12 16:02:21,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:21,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:21,571 INFO L214 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] [2022-12-12 16:02:21,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:21,777 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,SelfDestructingSolverStorable12 [2022-12-12 16:02:21,777 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2113420193, now seen corresponding path program 8 times [2022-12-12 16:02:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:21,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968259522] [2022-12-12 16:02:21,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:21,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:21,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968259522] [2022-12-12 16:02:21,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968259522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:21,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874790757] [2022-12-12 16:02:21,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:02:21,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:21,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:21,938 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) [2022-12-12 16:02:21,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-12 16:02:22,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:02:22,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:22,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-12 16:02:22,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:22,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 16:02:22,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874790757] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:22,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:22,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-12 16:02:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934588745] [2022-12-12 16:02:22,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 16:02:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 16:02:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-12 16:02:22,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:02:22,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 290 transitions, 4163 flow. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:22,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:22,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:02:22,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:23,059 INFO L130 PetriNetUnfolder]: 1488/2654 cut-off events. [2022-12-12 16:02:23,059 INFO L131 PetriNetUnfolder]: For 43586/43890 co-relation queries the response was YES. [2022-12-12 16:02:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19098 conditions, 2654 events. 1488/2654 cut-off events. For 43586/43890 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16037 event pairs, 270 based on Foata normal form. 421/3031 useless extension candidates. Maximal degree in co-relation 19029. Up to 791 conditions per place. [2022-12-12 16:02:23,082 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 96 selfloop transitions, 11 changer transitions 168/286 dead transitions. [2022-12-12 16:02:23,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 286 transitions, 4223 flow [2022-12-12 16:02:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 16:02:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 16:02:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 125 transitions. [2022-12-12 16:02:23,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3434065934065934 [2022-12-12 16:02:23,084 INFO L175 Difference]: Start difference. First operand has 218 places, 290 transitions, 4163 flow. Second operand 14 states and 125 transitions. [2022-12-12 16:02:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 286 transitions, 4223 flow [2022-12-12 16:02:23,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 286 transitions, 3727 flow, removed 60 selfloop flow, removed 28 redundant places. [2022-12-12 16:02:23,198 INFO L231 Difference]: Finished difference. Result has 191 places, 107 transitions, 1220 flow [2022-12-12 16:02:23,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2979, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1220, PETRI_PLACES=191, PETRI_TRANSITIONS=107} [2022-12-12 16:02:23,198 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2022-12-12 16:02:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 107 transitions, 1220 flow [2022-12-12 16:02:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:23,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:23,199 INFO L214 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] [2022-12-12 16:02:23,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-12 16:02:23,404 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,SelfDestructingSolverStorable13 [2022-12-12 16:02:23,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1346832685, now seen corresponding path program 9 times [2022-12-12 16:02:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:23,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339003312] [2022-12-12 16:02:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339003312] [2022-12-12 16:02:23,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339003312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:23,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249367735] [2022-12-12 16:02:23,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:02:23,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:23,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:23,498 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) [2022-12-12 16:02:23,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-12 16:02:23,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:02:23,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:23,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:02:23,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:23,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:23,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249367735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:23,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:23,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-12 16:02:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43833977] [2022-12-12 16:02:23,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:23,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 16:02:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 16:02:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-12 16:02:23,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:02:23,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 107 transitions, 1220 flow. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:23,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:23,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:02:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:24,021 INFO L130 PetriNetUnfolder]: 1079/1636 cut-off events. [2022-12-12 16:02:24,021 INFO L131 PetriNetUnfolder]: For 24874/25144 co-relation queries the response was YES. [2022-12-12 16:02:24,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12253 conditions, 1636 events. 1079/1636 cut-off events. For 24874/25144 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7134 event pairs, 258 based on Foata normal form. 141/1701 useless extension candidates. Maximal degree in co-relation 12197. Up to 1043 conditions per place. [2022-12-12 16:02:24,034 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 132 selfloop transitions, 32 changer transitions 0/176 dead transitions. [2022-12-12 16:02:24,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 176 transitions, 2436 flow [2022-12-12 16:02:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 16:02:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 16:02:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-12 16:02:24,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-12 16:02:24,035 INFO L175 Difference]: Start difference. First operand has 191 places, 107 transitions, 1220 flow. Second operand 8 states and 64 transitions. [2022-12-12 16:02:24,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 176 transitions, 2436 flow [2022-12-12 16:02:24,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 176 transitions, 2126 flow, removed 87 selfloop flow, removed 22 redundant places. [2022-12-12 16:02:24,066 INFO L231 Difference]: Finished difference. Result has 114 places, 109 transitions, 1148 flow [2022-12-12 16:02:24,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1148, PETRI_PLACES=114, PETRI_TRANSITIONS=109} [2022-12-12 16:02:24,067 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2022-12-12 16:02:24,067 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 109 transitions, 1148 flow [2022-12-12 16:02:24,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:24,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:24,067 INFO L214 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] [2022-12-12 16:02:24,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:24,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 16:02:24,273 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)] === [2022-12-12 16:02:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1898946153, now seen corresponding path program 10 times [2022-12-12 16:02:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:24,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386110583] [2022-12-12 16:02:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:24,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386110583] [2022-12-12 16:02:24,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386110583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:24,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737456466] [2022-12-12 16:02:24,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:02:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:24,412 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:24,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-12 16:02:24,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:02:24,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:24,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:24,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:24,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 16:02:24,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737456466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:24,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:24,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-12 16:02:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145369617] [2022-12-12 16:02:24,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:24,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-12 16:02:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-12 16:02:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-12 16:02:24,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:24,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 109 transitions, 1148 flow. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:24,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:24,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:24,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:25,461 INFO L130 PetriNetUnfolder]: 1486/2314 cut-off events. [2022-12-12 16:02:25,462 INFO L131 PetriNetUnfolder]: For 23771/23823 co-relation queries the response was YES. [2022-12-12 16:02:25,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15583 conditions, 2314 events. 1486/2314 cut-off events. For 23771/23823 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10882 event pairs, 359 based on Foata normal form. 43/2337 useless extension candidates. Maximal degree in co-relation 15542. Up to 1137 conditions per place. [2022-12-12 16:02:25,476 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 172 selfloop transitions, 54 changer transitions 0/230 dead transitions. [2022-12-12 16:02:25,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 230 transitions, 2728 flow [2022-12-12 16:02:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 16:02:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 16:02:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 133 transitions. [2022-12-12 16:02:25,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2022-12-12 16:02:25,478 INFO L175 Difference]: Start difference. First operand has 114 places, 109 transitions, 1148 flow. Second operand 15 states and 133 transitions. [2022-12-12 16:02:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 230 transitions, 2728 flow [2022-12-12 16:02:25,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 230 transitions, 2513 flow, removed 56 selfloop flow, removed 8 redundant places. [2022-12-12 16:02:25,505 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 1557 flow [2022-12-12 16:02:25,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1557, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2022-12-12 16:02:25,505 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2022-12-12 16:02:25,505 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 1557 flow [2022-12-12 16:02:25,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:25,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:25,506 INFO L214 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] [2022-12-12 16:02:25,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:25,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:25,711 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)] === [2022-12-12 16:02:25,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:25,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2052740497, now seen corresponding path program 11 times [2022-12-12 16:02:25,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:25,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103826787] [2022-12-12 16:02:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:25,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103826787] [2022-12-12 16:02:25,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103826787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111009214] [2022-12-12 16:02:25,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:02:25,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:25,824 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:25,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-12 16:02:26,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:02:26,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:26,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:02:26,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:26,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:26,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111009214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:26,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:26,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2022-12-12 16:02:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141191354] [2022-12-12 16:02:26,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:26,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 16:02:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 16:02:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-12 16:02:26,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:02:26,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 1557 flow. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:26,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:26,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:02:26,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:26,866 INFO L130 PetriNetUnfolder]: 1573/2420 cut-off events. [2022-12-12 16:02:26,866 INFO L131 PetriNetUnfolder]: For 24005/24005 co-relation queries the response was YES. [2022-12-12 16:02:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16538 conditions, 2420 events. 1573/2420 cut-off events. For 24005/24005 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10982 event pairs, 330 based on Foata normal form. 22/2442 useless extension candidates. Maximal degree in co-relation 16495. Up to 999 conditions per place. [2022-12-12 16:02:26,884 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 206 selfloop transitions, 115 changer transitions 0/321 dead transitions. [2022-12-12 16:02:26,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 321 transitions, 4349 flow [2022-12-12 16:02:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 16:02:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 16:02:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 141 transitions. [2022-12-12 16:02:26,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27115384615384613 [2022-12-12 16:02:26,885 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 1557 flow. Second operand 20 states and 141 transitions. [2022-12-12 16:02:26,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 321 transitions, 4349 flow [2022-12-12 16:02:26,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 321 transitions, 4044 flow, removed 149 selfloop flow, removed 4 redundant places. [2022-12-12 16:02:26,938 INFO L231 Difference]: Finished difference. Result has 142 places, 176 transitions, 2253 flow [2022-12-12 16:02:26,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2253, PETRI_PLACES=142, PETRI_TRANSITIONS=176} [2022-12-12 16:02:26,939 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2022-12-12 16:02:26,939 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 176 transitions, 2253 flow [2022-12-12 16:02:26,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:26,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:26,939 INFO L214 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] [2022-12-12 16:02:26,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:27,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 16:02:27,145 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)] === [2022-12-12 16:02:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1407816307, now seen corresponding path program 12 times [2022-12-12 16:02:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:27,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310347853] [2022-12-12 16:02:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310347853] [2022-12-12 16:02:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310347853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803047858] [2022-12-12 16:02:27,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 16:02:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:27,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:27,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-12 16:02:27,373 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-12 16:02:27,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:27,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:27,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:27,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:27,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803047858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:27,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:27,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-12 16:02:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277695878] [2022-12-12 16:02:27,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:27,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-12 16:02:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-12 16:02:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-12-12 16:02:27,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:27,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 176 transitions, 2253 flow. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:27,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:27,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:28,153 INFO L130 PetriNetUnfolder]: 1490/2302 cut-off events. [2022-12-12 16:02:28,153 INFO L131 PetriNetUnfolder]: For 20683/20695 co-relation queries the response was YES. [2022-12-12 16:02:28,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15483 conditions, 2302 events. 1490/2302 cut-off events. For 20683/20695 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10508 event pairs, 357 based on Foata normal form. 26/2325 useless extension candidates. Maximal degree in co-relation 15435. Up to 1137 conditions per place. [2022-12-12 16:02:28,171 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 147 selfloop transitions, 79 changer transitions 0/234 dead transitions. [2022-12-12 16:02:28,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 234 transitions, 3123 flow [2022-12-12 16:02:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 16:02:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 16:02:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-12-12 16:02:28,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33916083916083917 [2022-12-12 16:02:28,172 INFO L175 Difference]: Start difference. First operand has 142 places, 176 transitions, 2253 flow. Second operand 11 states and 97 transitions. [2022-12-12 16:02:28,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 234 transitions, 3123 flow [2022-12-12 16:02:28,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 234 transitions, 3015 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-12 16:02:28,218 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 2288 flow [2022-12-12 16:02:28,218 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2288, PETRI_PLACES=144, PETRI_TRANSITIONS=173} [2022-12-12 16:02:28,219 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2022-12-12 16:02:28,219 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 2288 flow [2022-12-12 16:02:28,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:28,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:28,219 INFO L214 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] [2022-12-12 16:02:28,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-12 16:02:28,427 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)] === [2022-12-12 16:02:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash 968291737, now seen corresponding path program 13 times [2022-12-12 16:02:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:28,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892106655] [2022-12-12 16:02:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892106655] [2022-12-12 16:02:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892106655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961765186] [2022-12-12 16:02:28,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 16:02:28,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:28,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:28,556 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:28,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-12 16:02:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:28,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:28,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:28,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961765186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:28,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:28,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-12 16:02:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800686292] [2022-12-12 16:02:28,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:28,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 16:02:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 16:02:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-12 16:02:28,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:28,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 173 transitions, 2288 flow. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:28,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:28,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:28,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:29,331 INFO L130 PetriNetUnfolder]: 1469/2253 cut-off events. [2022-12-12 16:02:29,331 INFO L131 PetriNetUnfolder]: For 20974/20988 co-relation queries the response was YES. [2022-12-12 16:02:29,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15264 conditions, 2253 events. 1469/2253 cut-off events. For 20974/20988 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10119 event pairs, 381 based on Foata normal form. 21/2272 useless extension candidates. Maximal degree in co-relation 15218. Up to 1193 conditions per place. [2022-12-12 16:02:29,351 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 141 selfloop transitions, 70 changer transitions 0/219 dead transitions. [2022-12-12 16:02:29,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 219 transitions, 3041 flow [2022-12-12 16:02:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 16:02:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 16:02:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-12-12 16:02:29,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31153846153846154 [2022-12-12 16:02:29,352 INFO L175 Difference]: Start difference. First operand has 144 places, 173 transitions, 2288 flow. Second operand 10 states and 81 transitions. [2022-12-12 16:02:29,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 219 transitions, 3041 flow [2022-12-12 16:02:29,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 219 transitions, 2881 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-12-12 16:02:29,399 INFO L231 Difference]: Finished difference. Result has 144 places, 174 transitions, 2294 flow [2022-12-12 16:02:29,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2294, PETRI_PLACES=144, PETRI_TRANSITIONS=174} [2022-12-12 16:02:29,400 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2022-12-12 16:02:29,400 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 174 transitions, 2294 flow [2022-12-12 16:02:29,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:29,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:29,400 INFO L214 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] [2022-12-12 16:02:29,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:29,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1587081957, now seen corresponding path program 14 times [2022-12-12 16:02:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:29,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507029186] [2022-12-12 16:02:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:29,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:29,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507029186] [2022-12-12 16:02:29,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507029186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:29,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075368303] [2022-12-12 16:02:29,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:02:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:29,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:29,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-12 16:02:29,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:02:29,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:29,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:29,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:29,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:30,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075368303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:30,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:30,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-12 16:02:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89316201] [2022-12-12 16:02:30,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:30,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 16:02:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 16:02:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-12 16:02:30,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:30,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 174 transitions, 2294 flow. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:30,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:30,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:30,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:30,543 INFO L130 PetriNetUnfolder]: 1494/2298 cut-off events. [2022-12-12 16:02:30,543 INFO L131 PetriNetUnfolder]: For 20227/20241 co-relation queries the response was YES. [2022-12-12 16:02:30,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15564 conditions, 2298 events. 1494/2298 cut-off events. For 20227/20241 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10438 event pairs, 278 based on Foata normal form. 27/2323 useless extension candidates. Maximal degree in co-relation 15517. Up to 969 conditions per place. [2022-12-12 16:02:30,561 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 170 selfloop transitions, 56 changer transitions 0/234 dead transitions. [2022-12-12 16:02:30,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 234 transitions, 3299 flow [2022-12-12 16:02:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 16:02:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 16:02:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-12-12 16:02:30,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-12 16:02:30,562 INFO L175 Difference]: Start difference. First operand has 144 places, 174 transitions, 2294 flow. Second operand 10 states and 80 transitions. [2022-12-12 16:02:30,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 234 transitions, 3299 flow [2022-12-12 16:02:30,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 234 transitions, 3213 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-12-12 16:02:30,608 INFO L231 Difference]: Finished difference. Result has 147 places, 178 transitions, 2416 flow [2022-12-12 16:02:30,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2416, PETRI_PLACES=147, PETRI_TRANSITIONS=178} [2022-12-12 16:02:30,608 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2022-12-12 16:02:30,608 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 178 transitions, 2416 flow [2022-12-12 16:02:30,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:30,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:30,609 INFO L214 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] [2022-12-12 16:02:30,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-12 16:02:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:30,814 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -438280645, now seen corresponding path program 15 times [2022-12-12 16:02:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:30,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752061058] [2022-12-12 16:02:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:30,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752061058] [2022-12-12 16:02:30,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752061058] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:30,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139525958] [2022-12-12 16:02:30,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:02:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:30,929 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:30,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-12 16:02:31,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:02:31,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:31,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:31,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:31,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:31,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139525958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:31,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:31,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-12 16:02:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180008759] [2022-12-12 16:02:31,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:31,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-12 16:02:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-12 16:02:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-12-12 16:02:31,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:31,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 178 transitions, 2416 flow. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:31,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:31,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:31,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:31,930 INFO L130 PetriNetUnfolder]: 1700/2584 cut-off events. [2022-12-12 16:02:31,930 INFO L131 PetriNetUnfolder]: For 23999/24013 co-relation queries the response was YES. [2022-12-12 16:02:31,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18057 conditions, 2584 events. 1700/2584 cut-off events. For 23999/24013 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11774 event pairs, 270 based on Foata normal form. 27/2609 useless extension candidates. Maximal degree in co-relation 18009. Up to 1099 conditions per place. [2022-12-12 16:02:31,956 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 221 selfloop transitions, 76 changer transitions 0/305 dead transitions. [2022-12-12 16:02:31,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 305 transitions, 4045 flow [2022-12-12 16:02:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 16:02:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 16:02:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-12-12 16:02:31,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2022-12-12 16:02:31,958 INFO L175 Difference]: Start difference. First operand has 147 places, 178 transitions, 2416 flow. Second operand 16 states and 151 transitions. [2022-12-12 16:02:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 305 transitions, 4045 flow [2022-12-12 16:02:32,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 305 transitions, 3936 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-12 16:02:32,018 INFO L231 Difference]: Finished difference. Result has 155 places, 179 transitions, 2542 flow [2022-12-12 16:02:32,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2542, PETRI_PLACES=155, PETRI_TRANSITIONS=179} [2022-12-12 16:02:32,019 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2022-12-12 16:02:32,019 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 179 transitions, 2542 flow [2022-12-12 16:02:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:32,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:32,019 INFO L214 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] [2022-12-12 16:02:32,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:32,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:32,225 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1636949393, now seen corresponding path program 16 times [2022-12-12 16:02:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:32,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932557931] [2022-12-12 16:02:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932557931] [2022-12-12 16:02:32,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932557931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716141704] [2022-12-12 16:02:32,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:02:32,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:32,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:32,331 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:32,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-12 16:02:32,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:02:32,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:32,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 16:02:32,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:32,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 16:02:32,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716141704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:02:32,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:02:32,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-12 16:02:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851366816] [2022-12-12 16:02:32,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:02:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 16:02:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:02:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 16:02:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-12 16:02:32,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:02:32,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 179 transitions, 2542 flow. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:32,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:02:32,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:02:32,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:02:33,361 INFO L130 PetriNetUnfolder]: 1682/2538 cut-off events. [2022-12-12 16:02:33,361 INFO L131 PetriNetUnfolder]: For 27200/27214 co-relation queries the response was YES. [2022-12-12 16:02:33,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18301 conditions, 2538 events. 1682/2538 cut-off events. For 27200/27214 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11275 event pairs, 606 based on Foata normal form. 21/2557 useless extension candidates. Maximal degree in co-relation 18251. Up to 2048 conditions per place. [2022-12-12 16:02:33,380 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 169 selfloop transitions, 43 changer transitions 0/220 dead transitions. [2022-12-12 16:02:33,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 220 transitions, 3291 flow [2022-12-12 16:02:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 16:02:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 16:02:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-12 16:02:33,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2846153846153846 [2022-12-12 16:02:33,382 INFO L175 Difference]: Start difference. First operand has 155 places, 179 transitions, 2542 flow. Second operand 10 states and 74 transitions. [2022-12-12 16:02:33,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 220 transitions, 3291 flow [2022-12-12 16:02:33,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 220 transitions, 3146 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-12-12 16:02:33,442 INFO L231 Difference]: Finished difference. Result has 153 places, 180 transitions, 2503 flow [2022-12-12 16:02:33,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2399, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2503, PETRI_PLACES=153, PETRI_TRANSITIONS=180} [2022-12-12 16:02:33,442 INFO L295 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2022-12-12 16:02:33,442 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 180 transitions, 2503 flow [2022-12-12 16:02:33,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:02:33,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:02:33,443 INFO L214 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] [2022-12-12 16:02:33,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:33,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-12 16:02:33,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:02:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:02:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 78659118, now seen corresponding path program 3 times [2022-12-12 16:02:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:02:33,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558199594] [2022-12-12 16:02:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:02:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:02:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:02:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:02:35,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:02:35,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558199594] [2022-12-12 16:02:35,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558199594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:02:35,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083637818] [2022-12-12 16:02:35,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:02:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:02:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:02:35,585 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:02:35,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-12 16:02:35,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:02:35,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:02:35,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-12 16:02:35,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:02:35,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:35,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:35,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:35,845 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-12 16:02:35,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-12-12 16:02:35,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 16:02:35,979 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 16:02:35,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-12 16:02:36,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:02:36,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:02:36,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:02:36,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:36,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:36,391 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-12 16:02:36,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-12 16:02:36,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:36,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:36,533 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-12 16:02:36,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-12 16:02:36,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:02:36,784 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-12 16:02:36,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2022-12-12 16:02:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:02:36,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:02:37,214 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (<= c_~res1~0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 c_~B~0.base)) (.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 c_~A~0.offset) c_~res2~0 (select .cse2 c_~B~0.offset) (select .cse2 (+ .cse1 c_~B~0.offset)))))) (< 1 ~M~0))) (forall ((~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (< (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 c_~B~0.base)) (.cse5 (* ~M~0 4))) (+ (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 c_~A~0.offset) c_~res2~0 (select .cse6 c_~B~0.offset) (select .cse6 (+ .cse5 c_~B~0.offset))))) (+ c_~res1~0 1)) (< 1 ~M~0)))) is different from false [2022-12-12 16:02:37,255 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ .cse10 c_~A~0.offset))) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ .cse10 c_~B~0.offset)))) (and (forall ((~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (< (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 c_~B~0.base)) (.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 c_~A~0.offset) c_~res2~0 (select .cse2 c_~B~0.offset) (select .cse2 (+ .cse1 c_~B~0.offset))))) (+ .cse4 .cse5 c_~res1~0 1)) (< 1 ~M~0))) (forall ((~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (<= (+ .cse4 .cse5 c_~res1~0) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse6 (select .cse9 c_~A~0.base)) (.cse8 (select .cse9 c_~B~0.base)) (.cse7 (* ~M~0 4))) (+ (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse6 c_~A~0.offset) c_~res2~0 (select .cse8 c_~B~0.offset) (select .cse8 (+ .cse7 c_~B~0.offset)))))) (< 1 ~M~0)))))) is different from false [2022-12-12 16:02:37,285 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse1 (+ .cse12 c_~B~0.offset)) (.cse2 (+ .cse12 c_~A~0.offset))) (and (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (<= (+ c_~res1~0 (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2)) (let ((.cse6 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse3 (select .cse6 c_~A~0.base)) (.cse5 (* ~M~0 4)) (.cse4 (select .cse6 c_~B~0.base))) (+ (select .cse3 c_~A~0.offset) (select .cse4 (+ .cse5 c_~B~0.offset)) c_~res2~0 (select .cse3 (+ c_~A~0.offset .cse5)) (select .cse4 c_~B~0.offset)))))) (< 1 ~M~0))) (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (< (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse7 (select .cse10 c_~A~0.base)) (.cse9 (* ~M~0 4)) (.cse8 (select .cse10 c_~B~0.base))) (+ (select .cse7 c_~A~0.offset) (select .cse8 (+ .cse9 c_~B~0.offset)) c_~res2~0 (select .cse7 (+ c_~A~0.offset .cse9)) (select .cse8 c_~B~0.offset)))) (+ c_~res1~0 (select (select .cse11 c_~B~0.base) .cse1) (select (select .cse11 c_~A~0.base) .cse2) 1))) (not (< 0 ~M~0)) (< 1 ~M~0)))))) is different from false [2022-12-12 16:02:37,315 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ .cse14 c_~A~0.offset))) (.cse1 (select (select |c_#memory_int| c_~B~0.base) (+ .cse14 c_~B~0.offset))) (.cse3 (+ .cse14 c_~A~0.offset 4)) (.cse4 (+ .cse14 4 c_~B~0.offset))) (and (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (<= (+ .cse0 .cse1 (select (select .cse2 c_~A~0.base) .cse3) c_~res1~0 (select (select .cse2 c_~B~0.base) .cse4)) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse5 (select .cse8 c_~A~0.base)) (.cse7 (* ~M~0 4)) (.cse6 (select .cse8 c_~B~0.base))) (+ (select .cse5 c_~A~0.offset) (select .cse6 (+ .cse7 c_~B~0.offset)) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse7)) (select .cse6 c_~B~0.offset)))))) (< 1 ~M~0))) (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (< (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse9 (select .cse12 c_~A~0.base)) (.cse11 (* ~M~0 4)) (.cse10 (select .cse12 c_~B~0.base))) (+ (select .cse9 c_~A~0.offset) (select .cse10 (+ .cse11 c_~B~0.offset)) c_~res2~0 (select .cse9 (+ c_~A~0.offset .cse11)) (select .cse10 c_~B~0.offset)))) (+ .cse0 .cse1 (select (select .cse13 c_~A~0.base) .cse3) c_~res1~0 (select (select .cse13 c_~B~0.base) .cse4) 1))) (< 1 ~M~0)))))) is different from false [2022-12-12 16:02:37,333 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ 4 c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (<= (+ .cse0 (select (select .cse1 c_~B~0.base) .cse2) .cse3 c_~res1~0 (select (select .cse1 c_~A~0.base) .cse4)) (let ((.cse8 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse5 (select .cse8 c_~A~0.base)) (.cse7 (* ~M~0 4)) (.cse6 (select .cse8 c_~B~0.base))) (+ (select .cse5 c_~A~0.offset) (select .cse6 (+ .cse7 c_~B~0.offset)) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse7)) (select .cse6 c_~B~0.offset)))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_1229 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (< (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse9 (select .cse12 c_~A~0.base)) (.cse11 (* ~M~0 4)) (.cse10 (select .cse12 c_~B~0.base))) (+ (select .cse9 c_~A~0.offset) (select .cse10 (+ .cse11 c_~B~0.offset)) c_~res2~0 (select .cse9 (+ c_~A~0.offset .cse11)) (select .cse10 c_~B~0.offset)))) (+ .cse0 (select (select .cse13 c_~B~0.base) .cse2) .cse3 c_~res1~0 (select (select .cse13 c_~A~0.base) .cse4) 1))) (not (< 0 ~M~0)) (< 1 ~M~0))))) is different from false [2022-12-12 16:02:37,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_~B~0.base_129 Int)) (or (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1228))) (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (<= (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse2 v_~B~0.base_129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse0 v_~B~0.base_129) .cse3) c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset)) (let ((.cse7 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse4 (select .cse7 v_~B~0.base_129)) (.cse6 (* ~M~0 4)) (.cse5 (select .cse7 c_~A~0.base))) (+ (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse6)) (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 c_~A~0.offset))))))) (< 1 ~M~0))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~B~0.base_129))) (forall ((v_~B~0.base_129 Int)) (or (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1228))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (< (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse8 (select .cse11 v_~B~0.base_129)) (.cse10 (* ~M~0 4)) (.cse9 (select .cse11 c_~A~0.base))) (+ (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (select .cse9 (+ c_~A~0.offset .cse10)) (select .cse8 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse9 c_~A~0.offset)))) (+ (select (select .cse12 c_~A~0.base) .cse1) (select (select .cse13 v_~B~0.base_129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse12 v_~B~0.base_129) .cse3) c_~res1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset) 1)))) (< 1 ~M~0))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~B~0.base_129))))) is different from false [2022-12-12 16:02:37,444 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (v_~B~0.base_129 Int)) (or (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1228))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (<= (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 v_~B~0.base_129) .cse2) c_~res1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset) (select (select .cse3 v_~B~0.base_129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse7 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse4 (select .cse7 v_~B~0.base_129)) (.cse5 (select .cse7 c_~A~0.base)) (.cse6 (* ~M~0 4))) (+ (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 c_~A~0.offset) c_~res2~0 (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ c_~A~0.offset .cse6)))))))) (< 1 ~M~0))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~B~0.base_129))) (forall ((v_ArrVal_1227 (Array Int Int)) (v_~B~0.base_129 Int)) (or (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (~M~0 Int) (v_ArrVal_1230 (Array Int Int))) (or (not (< 0 ~M~0)) (< 1 ~M~0) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1228))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229))) (< (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1230))) (let ((.cse8 (select .cse11 v_~B~0.base_129)) (.cse9 (select .cse11 c_~A~0.base)) (.cse10 (* ~M~0 4))) (+ (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse9 c_~A~0.offset) c_~res2~0 (select .cse8 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse9 (+ c_~A~0.offset .cse10))))) (+ (select (select .cse12 c_~A~0.base) .cse1) (select (select .cse12 v_~B~0.base_129) .cse2) c_~res1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset) 1 (select (select .cse13 v_~B~0.base_129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~B~0.base_129))))) is different from false [2022-12-12 16:02:37,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:02:37,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 145 [2022-12-12 16:02:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:02:54,436 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-12-12 16:02:54,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-12 16:02:54,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-12 16:02:54,642 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 898571 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 898571 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2022-12-12 16:02:54,645 INFO L158 Benchmark]: Toolchain (without parser) took 83829.49ms. Allocated memory was 184.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 152.9MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-12 16:02:54,645 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 16:02:54,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.32ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 140.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 16:02:54,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.82ms. Allocated memory is still 184.5MB. Free memory was 140.3MB in the beginning and 137.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 16:02:54,646 INFO L158 Benchmark]: Boogie Preprocessor took 40.86ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 135.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 16:02:54,646 INFO L158 Benchmark]: RCFGBuilder took 787.66ms. Allocated memory is still 184.5MB. Free memory was 135.8MB in the beginning and 139.2MB in the end (delta: -3.4MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2022-12-12 16:02:54,646 INFO L158 Benchmark]: TraceAbstraction took 82689.25ms. Allocated memory was 184.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 138.1MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-12 16:02:54,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.32ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 140.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.82ms. Allocated memory is still 184.5MB. Free memory was 140.3MB in the beginning and 137.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.86ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 135.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 787.66ms. Allocated memory is still 184.5MB. Free memory was 135.8MB in the beginning and 139.2MB in the end (delta: -3.4MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. * TraceAbstraction took 82689.25ms. Allocated memory was 184.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 138.1MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 157 PlacesBefore, 31 PlacesAfterwards, 163 TransitionsBefore, 26 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 96 TrivialYvCompositions, 30 ConcurrentYvCompositions, 11 ChoiceCompositions, 137 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 715, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 721, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 721, unknown conditional: 0, unknown unconditional: 721] , Statistics on independence cache: Total cache size (in pairs): 1137, Positive cache size: 1131, Positive conditional cache size: 0, Positive unconditional cache size: 1131, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 898571 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 898571 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-12 16:02:54,857 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 [2022-12-12 16:02:54,911 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 Received shutdown request...