/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 21:49:50,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 21:49:50,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 21:49:50,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 21:49:50,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 21:49:50,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 21:49:50,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 21:49:50,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 21:49:50,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 21:49:50,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 21:49:50,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 21:49:50,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 21:49:50,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 21:49:50,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 21:49:50,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 21:49:50,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 21:49:50,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 21:49:50,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 21:49:50,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 21:49:50,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 21:49:50,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 21:49:50,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 21:49:50,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 21:49:50,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 21:49:50,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 21:49:50,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 21:49:50,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 21:49:50,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 21:49:50,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 21:49:50,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 21:49:50,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 21:49:50,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 21:49:50,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 21:49:50,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 21:49:50,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 21:49:50,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 21:49:50,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 21:49:50,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 21:49:50,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 21:49:50,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 21:49:50,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 21:49:50,495 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-05 21:49:50,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 21:49:50,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 21:49:50,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 21:49:50,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 21:49:50,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 21:49:50,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 21:49:50,519 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 21:49:50,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 21:49:50,520 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 21:49:50,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 21:49:50,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 21:49:50,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 21:49:50,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 21:49:50,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 21:49:50,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:49:50,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 21:49:50,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 21:49:50,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 21:49:50,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 21:49:50,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 21:49:50,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 21:49:50,536 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-05 21:49:50,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 21:49:50,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 21:49:50,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 21:49:50,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 21:49:50,789 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 21:49:50,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-05 21:49:51,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 21:49:51,994 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 21:49:51,994 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-05 21:49:52,004 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63dcbbdf/a46a9270283341b89c7fdf81c521d8c2/FLAG1972d8fbb [2022-12-05 21:49:52,014 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63dcbbdf/a46a9270283341b89c7fdf81c521d8c2 [2022-12-05 21:49:52,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 21:49:52,017 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 21:49:52,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 21:49:52,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 21:49:52,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 21:49:52,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5b9b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52, skipping insertion in model container [2022-12-05 21:49:52,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 21:49:52,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 21:49:52,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,149 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-min-array-hom.wvr.c[2586,2599] [2022-12-05 21:49:52,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:49:52,160 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 21:49:52,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:49:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:49:52,174 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-min-array-hom.wvr.c[2586,2599] [2022-12-05 21:49:52,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:49:52,185 INFO L208 MainTranslator]: Completed translation [2022-12-05 21:49:52,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52 WrapperNode [2022-12-05 21:49:52,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 21:49:52,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 21:49:52,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 21:49:52,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 21:49:52,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,211 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-05 21:49:52,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 21:49:52,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 21:49:52,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 21:49:52,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 21:49:52,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 21:49:52,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 21:49:52,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 21:49:52,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 21:49:52,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (1/1) ... [2022-12-05 21:49:52,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:49:52,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:49:52,280 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-05 21:49:52,287 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-05 21:49:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 21:49:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 21:49:52,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 21:49:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 21:49:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 21:49:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 21:49:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 21:49:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 21:49:52,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 21:49:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 21:49:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 21:49:52,316 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 21:49:52,390 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 21:49:52,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 21:49:52,578 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 21:49:52,662 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 21:49:52,662 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 21:49:52,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:49:52 BoogieIcfgContainer [2022-12-05 21:49:52,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 21:49:52,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 21:49:52,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 21:49:52,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 21:49:52,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:49:52" (1/3) ... [2022-12-05 21:49:52,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23800ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:49:52, skipping insertion in model container [2022-12-05 21:49:52,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:49:52" (2/3) ... [2022-12-05 21:49:52,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23800ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:49:52, skipping insertion in model container [2022-12-05 21:49:52,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:49:52" (3/3) ... [2022-12-05 21:49:52,670 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-12-05 21:49:52,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 21:49:52,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 21:49:52,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 21:49:52,778 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 21:49:52,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-05 21:49:52,934 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-05 21:49:52,934 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:49:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 12/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-05 21:49:52,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-05 21:49:52,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-05 21:49:52,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 21:49:52,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-05 21:49:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-05 21:49:53,020 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-05 21:49:53,020 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:49:53,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 12/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-05 21:49:53,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-05 21:49:53,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-05 21:49:57,304 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-05 21:49:57,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 21:49:57,339 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;@20c98d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 21:49:57,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 21:49:57,354 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-05 21:49:57,354 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 21:49:57,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:49:57,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:49:57,355 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-05 21:49:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:49:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-05 21:49:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:49:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458164967] [2022-12-05 21:49:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:49:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:49:57,792 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-05 21:49:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:49:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458164967] [2022-12-05 21:49:57,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458164967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:49:57,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:49:57,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 21:49:57,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079618469] [2022-12-05 21:49:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:49:57,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 21:49:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:49:57,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 21:49:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 21:49:57,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 21:49:57,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05 21:49:57,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:49:57,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 21:49:57,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:49:57,901 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-05 21:49:57,901 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-05 21:49:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 376 events. 269/376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 133 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 615. Up to 373 conditions per place. [2022-12-05 21:49:57,904 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 21:49:57,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-05 21:49:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:49:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:49:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 21:49:57,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 21:49:57,913 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-05 21:49:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-05 21:49:57,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 21:49:57,917 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-05 21:49:57,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-05 21:49:57,920 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 21:49:57,920 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 66 flow [2022-12-05 21:49:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05 21:49:57,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:49:57,921 INFO L213 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-05 21:49:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 21:49:57,921 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-05 21:49:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:49:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1575989531, now seen corresponding path program 1 times [2022-12-05 21:49:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:49:57,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421525652] [2022-12-05 21:49:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:49:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:49:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:49:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:49:57,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421525652] [2022-12-05 21:49:57,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421525652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:49:57,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009823852] [2022-12-05 21:49:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:49:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:49:57,995 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-05 21:49:57,996 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-05 21:49:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:49:58,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 21:49:58,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:49:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:49:58,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:49:58,215 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-05 21:49:58,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009823852] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 21:49:58,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 21:49:58,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-05 21:49:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967116394] [2022-12-05 21:49:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:49:58,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 21:49:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:49:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 21:49:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-05 21:49:58,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 21:49:58,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-05 21:49:58,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:49:58,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 21:49:58,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:49:58,353 INFO L130 PetriNetUnfolder]: 309/442 cut-off events. [2022-12-05 21:49:58,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 21:49:58,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 442 events. 309/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1403 event pairs, 49 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 889. Up to 335 conditions per place. [2022-12-05 21:49:58,355 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-05 21:49:58,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2022-12-05 21:49:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 21:49:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 21:49:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 21:49:58,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-05 21:49:58,360 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 66 flow. Second operand 5 states and 44 transitions. [2022-12-05 21:49:58,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2022-12-05 21:49:58,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 150 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 21:49:58,361 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 78 flow [2022-12-05 21:49:58,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-12-05 21:49:58,361 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-05 21:49:58,361 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 78 flow [2022-12-05 21:49:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-05 21:49:58,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:49:58,362 INFO L213 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-05 21:49:58,376 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-05 21:49:58,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:49:58,567 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-05 21:49:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:49:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 17282664, now seen corresponding path program 1 times [2022-12-05 21:49:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:49:58,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843763613] [2022-12-05 21:49:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:49:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:49:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:49:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:49:58,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843763613] [2022-12-05 21:49:58,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843763613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:49:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235838421] [2022-12-05 21:49:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:49:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:49:58,698 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-05 21:49:58,699 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-05 21:49:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:49:58,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:49:58,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:49:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:49:58,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:49:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:49:58,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235838421] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 21:49:58,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 21:49:58,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-12-05 21:49:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003855768] [2022-12-05 21:49:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:49:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:49:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:49:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:49:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-05 21:49:58,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:49:58,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:49:58,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:49:58,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:49:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:49:58,987 INFO L130 PetriNetUnfolder]: 280/414 cut-off events. [2022-12-05 21:49:58,988 INFO L131 PetriNetUnfolder]: For 75/106 co-relation queries the response was YES. [2022-12-05 21:49:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 414 events. 280/414 cut-off events. For 75/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1270 event pairs, 28 based on Foata normal form. 31/348 useless extension candidates. Maximal degree in co-relation 961. Up to 242 conditions per place. [2022-12-05 21:49:58,990 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 46 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-05 21:49:58,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 274 flow [2022-12-05 21:49:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 21:49:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 21:49:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-05 21:49:58,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3177083333333333 [2022-12-05 21:49:58,991 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 78 flow. Second operand 8 states and 61 transitions. [2022-12-05 21:49:58,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 274 flow [2022-12-05 21:49:58,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 257 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 21:49:58,992 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 110 flow [2022-12-05 21:49:58,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-05 21:49:58,993 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-05 21:49:58,993 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 110 flow [2022-12-05 21:49:58,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:49:58,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:49:58,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:49:59,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 21:49:59,214 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,SelfDestructingSolverStorable2 [2022-12-05 21:49:59,215 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-05 21:49:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:49:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1266595511, now seen corresponding path program 1 times [2022-12-05 21:49:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:49:59,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127826336] [2022-12-05 21:49:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:49:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:49:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:50:00,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127826336] [2022-12-05 21:50:00,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127826336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:50:00,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413076825] [2022-12-05 21:50:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:50:00,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:00,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:50:00,188 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-05 21:50:00,190 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-05 21:50:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:00,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-05 21:50:00,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:50:00,321 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 11 treesize of output 7 [2022-12-05 21:50:00,368 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-05 21:50:00,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 21:50:00,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 21:50:00,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 21:50:00,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-05 21:50:00,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:00,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-12-05 21:50:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:01,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:50:08,134 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 21:50:09,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:09,495 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 111 treesize of output 75 [2022-12-05 21:50:09,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:09,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2553 treesize of output 2427 [2022-12-05 21:50:09,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2380 treesize of output 2188 [2022-12-05 21:50:09,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2188 treesize of output 1804 [2022-12-05 21:50:09,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:09,576 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 1833 treesize of output 1743 [2022-12-05 21:50:14,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:14,293 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 140 treesize of output 92 [2022-12-05 21:50:14,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:14,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2681 treesize of output 2431 [2022-12-05 21:50:14,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:14,337 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 2421 treesize of output 2269 [2022-12-05 21:50:14,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2241 treesize of output 1857 [2022-12-05 21:50:14,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1857 treesize of output 1665 [2022-12-05 21:50:40,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:40,394 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 78 treesize of output 54 [2022-12-05 21:50:40,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,403 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-12-05 21:50:40,418 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,418 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 43 treesize of output 37 [2022-12-05 21:50:40,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:40,477 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 78 treesize of output 54 [2022-12-05 21:50:40,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,486 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-12-05 21:50:40,497 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,497 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 43 treesize of output 37 [2022-12-05 21:50:40,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:40,529 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 120 treesize of output 84 [2022-12-05 21:50:40,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,549 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2022-12-05 21:50:40,561 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,562 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 60 treesize of output 44 [2022-12-05 21:50:40,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:40,605 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 55 treesize of output 43 [2022-12-05 21:50:40,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:40,616 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-12-05 21:50:40,626 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:50:40,627 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 23 treesize of output 19 [2022-12-05 21:50:40,650 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 21:50:40,650 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 88 treesize of output 1 [2022-12-05 21:50:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:40,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413076825] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:50:40,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:50:40,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2022-12-05 21:50:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299433608] [2022-12-05 21:50:40,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:50:40,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-05 21:50:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:50:40,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-05 21:50:40,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=992, Unknown=29, NotChecked=0, Total=1190 [2022-12-05 21:50:40,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:50:40,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 110 flow. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:50:40,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:50:40,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:50:40,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:50:43,923 INFO L130 PetriNetUnfolder]: 1069/1576 cut-off events. [2022-12-05 21:50:43,924 INFO L131 PetriNetUnfolder]: For 659/659 co-relation queries the response was YES. [2022-12-05 21:50:43,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 1576 events. 1069/1576 cut-off events. For 659/659 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6060 event pairs, 60 based on Foata normal form. 2/1228 useless extension candidates. Maximal degree in co-relation 2927. Up to 765 conditions per place. [2022-12-05 21:50:43,946 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 164 selfloop transitions, 97 changer transitions 6/267 dead transitions. [2022-12-05 21:50:43,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 267 transitions, 1387 flow [2022-12-05 21:50:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-05 21:50:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-05 21:50:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 255 transitions. [2022-12-05 21:50:43,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32196969696969696 [2022-12-05 21:50:43,952 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 110 flow. Second operand 33 states and 255 transitions. [2022-12-05 21:50:43,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 267 transitions, 1387 flow [2022-12-05 21:50:43,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 267 transitions, 1344 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-05 21:50:43,962 INFO L231 Difference]: Finished difference. Result has 76 places, 128 transitions, 729 flow [2022-12-05 21:50:43,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=729, PETRI_PLACES=76, PETRI_TRANSITIONS=128} [2022-12-05 21:50:43,964 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-05 21:50:43,964 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 128 transitions, 729 flow [2022-12-05 21:50:43,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:50:43,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:50:43,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:50:43,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 21:50:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:44,172 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-05 21:50:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:50:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1944875769, now seen corresponding path program 2 times [2022-12-05 21:50:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:50:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162376456] [2022-12-05 21:50:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:50:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:50:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:50:44,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162376456] [2022-12-05 21:50:44,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162376456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:50:44,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010952143] [2022-12-05 21:50:44,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:50:44,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:50:44,838 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-05 21:50:44,844 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-05 21:50:44,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:50:44,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:50:44,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-05 21:50:44,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:50:45,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 21:50:45,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:45,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-05 21:50:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:45,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:50:45,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:45,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-12-05 21:50:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:45,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010952143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:50:45,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:50:45,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-05 21:50:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654571544] [2022-12-05 21:50:45,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:50:45,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 21:50:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:50:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 21:50:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-12-05 21:50:45,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:50:45,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 128 transitions, 729 flow. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:50:45,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:50:45,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:50:45,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:50:46,782 INFO L130 PetriNetUnfolder]: 1307/1936 cut-off events. [2022-12-05 21:50:46,782 INFO L131 PetriNetUnfolder]: For 2561/2561 co-relation queries the response was YES. [2022-12-05 21:50:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 1936 events. 1307/1936 cut-off events. For 2561/2561 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7820 event pairs, 242 based on Foata normal form. 10/1886 useless extension candidates. Maximal degree in co-relation 6600. Up to 1523 conditions per place. [2022-12-05 21:50:46,793 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 156 selfloop transitions, 80 changer transitions 7/243 dead transitions. [2022-12-05 21:50:46,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 243 transitions, 1643 flow [2022-12-05 21:50:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 21:50:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 21:50:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 159 transitions. [2022-12-05 21:50:46,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33125 [2022-12-05 21:50:46,794 INFO L175 Difference]: Start difference. First operand has 76 places, 128 transitions, 729 flow. Second operand 20 states and 159 transitions. [2022-12-05 21:50:46,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 243 transitions, 1643 flow [2022-12-05 21:50:46,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 243 transitions, 1610 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-05 21:50:46,806 INFO L231 Difference]: Finished difference. Result has 100 places, 165 transitions, 1111 flow [2022-12-05 21:50:46,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1111, PETRI_PLACES=100, PETRI_TRANSITIONS=165} [2022-12-05 21:50:46,808 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2022-12-05 21:50:46,808 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 165 transitions, 1111 flow [2022-12-05 21:50:46,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:50:46,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:50:46,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:50:46,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 21:50:47,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:47,013 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-05 21:50:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:50:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 310321915, now seen corresponding path program 3 times [2022-12-05 21:50:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:50:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981546279] [2022-12-05 21:50:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:50:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:50:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:50:47,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981546279] [2022-12-05 21:50:47,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981546279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:50:47,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870931895] [2022-12-05 21:50:47,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:50:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:50:47,551 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-05 21:50:47,552 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-05 21:50:47,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 21:50:47,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:50:47,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-05 21:50:47,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:50:47,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:47,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-12-05 21:50:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:48,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:50:48,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:48,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-12-05 21:50:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:48,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870931895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:50:48,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:50:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-12-05 21:50:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472683135] [2022-12-05 21:50:48,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:50:48,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-05 21:50:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:50:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-05 21:50:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2022-12-05 21:50:48,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:50:48,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 165 transitions, 1111 flow. Second operand has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-05 21:50:48,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:50:48,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:50:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:50:49,889 INFO L130 PetriNetUnfolder]: 1510/2271 cut-off events. [2022-12-05 21:50:49,889 INFO L131 PetriNetUnfolder]: For 4751/4751 co-relation queries the response was YES. [2022-12-05 21:50:49,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 2271 events. 1510/2271 cut-off events. For 4751/4751 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9728 event pairs, 290 based on Foata normal form. 2/2273 useless extension candidates. Maximal degree in co-relation 8660. Up to 1789 conditions per place. [2022-12-05 21:50:49,904 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 187 selfloop transitions, 96 changer transitions 9/292 dead transitions. [2022-12-05 21:50:49,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 292 transitions, 2235 flow [2022-12-05 21:50:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 21:50:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 21:50:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 186 transitions. [2022-12-05 21:50:49,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-05 21:50:49,905 INFO L175 Difference]: Start difference. First operand has 100 places, 165 transitions, 1111 flow. Second operand 24 states and 186 transitions. [2022-12-05 21:50:49,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 292 transitions, 2235 flow [2022-12-05 21:50:49,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 292 transitions, 2186 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-05 21:50:49,922 INFO L231 Difference]: Finished difference. Result has 123 places, 196 transitions, 1551 flow [2022-12-05 21:50:49,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1551, PETRI_PLACES=123, PETRI_TRANSITIONS=196} [2022-12-05 21:50:49,923 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2022-12-05 21:50:49,923 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 196 transitions, 1551 flow [2022-12-05 21:50:49,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.25) internal successors, (63), 28 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-05 21:50:49,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:50:49,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:50:49,929 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-05 21:50:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:50,129 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-05 21:50:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:50:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1359119881, now seen corresponding path program 4 times [2022-12-05 21:50:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:50:50,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243966038] [2022-12-05 21:50:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:50:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:50:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:50:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243966038] [2022-12-05 21:50:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243966038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:50:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531441310] [2022-12-05 21:50:50,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:50:50,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:50:50,676 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-05 21:50:50,677 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-05 21:50:50,744 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:50:50,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:50:50,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-05 21:50:50,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:50:51,051 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-05 21:50:51,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2022-12-05 21:50:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:50:51,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:50:51,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:51,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-12-05 21:50:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:50:51,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531441310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:50:51,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:50:51,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2022-12-05 21:50:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851156395] [2022-12-05 21:50:51,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:50:51,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 21:50:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:50:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 21:50:51,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-12-05 21:50:51,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:50:51,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 196 transitions, 1551 flow. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 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-05 21:50:51,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:50:51,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:50:51,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:50:54,544 INFO L130 PetriNetUnfolder]: 3566/5517 cut-off events. [2022-12-05 21:50:54,545 INFO L131 PetriNetUnfolder]: For 16430/16430 co-relation queries the response was YES. [2022-12-05 21:50:54,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23120 conditions, 5517 events. 3566/5517 cut-off events. For 16430/16430 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30729 event pairs, 129 based on Foata normal form. 6/5523 useless extension candidates. Maximal degree in co-relation 22918. Up to 2234 conditions per place. [2022-12-05 21:50:54,591 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 327 selfloop transitions, 337 changer transitions 23/687 dead transitions. [2022-12-05 21:50:54,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 687 transitions, 5947 flow [2022-12-05 21:50:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-05 21:50:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-05 21:50:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 367 transitions. [2022-12-05 21:50:54,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3398148148148148 [2022-12-05 21:50:54,593 INFO L175 Difference]: Start difference. First operand has 123 places, 196 transitions, 1551 flow. Second operand 45 states and 367 transitions. [2022-12-05 21:50:54,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 687 transitions, 5947 flow [2022-12-05 21:50:54,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 687 transitions, 5637 flow, removed 113 selfloop flow, removed 10 redundant places. [2022-12-05 21:50:54,670 INFO L231 Difference]: Finished difference. Result has 181 places, 443 transitions, 4289 flow [2022-12-05 21:50:54,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4289, PETRI_PLACES=181, PETRI_TRANSITIONS=443} [2022-12-05 21:50:54,671 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2022-12-05 21:50:54,671 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 443 transitions, 4289 flow [2022-12-05 21:50:54,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 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-05 21:50:54,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:50:54,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:50:54,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 21:50:54,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:54,878 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-05 21:50:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:50:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -77713189, now seen corresponding path program 5 times [2022-12-05 21:50:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:50:54,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141850023] [2022-12-05 21:50:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:50:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:50:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:50:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:50:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141850023] [2022-12-05 21:50:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141850023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:50:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620520375] [2022-12-05 21:50:55,399 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:50:55,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:50:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:50:55,406 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-05 21:50:55,443 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-05 21:50:55,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:50:55,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:50:55,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-05 21:50:55,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:50:55,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:55,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-12-05 21:50:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:55,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:50:56,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:50:56,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-12-05 21:50:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:50:56,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620520375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:50:56,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:50:56,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 25 [2022-12-05 21:50:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064529024] [2022-12-05 21:50:56,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:50:56,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-05 21:50:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:50:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-05 21:50:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-12-05 21:50:56,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:50:56,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 443 transitions, 4289 flow. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:50:56,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:50:56,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:50:56,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:50:59,881 INFO L130 PetriNetUnfolder]: 4752/7398 cut-off events. [2022-12-05 21:50:59,882 INFO L131 PetriNetUnfolder]: For 46122/46122 co-relation queries the response was YES. [2022-12-05 21:50:59,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39652 conditions, 7398 events. 4752/7398 cut-off events. For 46122/46122 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 43488 event pairs, 438 based on Foata normal form. 4/7402 useless extension candidates. Maximal degree in co-relation 39472. Up to 4384 conditions per place. [2022-12-05 21:50:59,947 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 431 selfloop transitions, 357 changer transitions 7/795 dead transitions. [2022-12-05 21:50:59,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 795 transitions, 8698 flow [2022-12-05 21:50:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-05 21:50:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-05 21:50:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 268 transitions. [2022-12-05 21:50:59,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.319047619047619 [2022-12-05 21:50:59,949 INFO L175 Difference]: Start difference. First operand has 181 places, 443 transitions, 4289 flow. Second operand 35 states and 268 transitions. [2022-12-05 21:50:59,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 795 transitions, 8698 flow [2022-12-05 21:51:00,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 795 transitions, 8140 flow, removed 219 selfloop flow, removed 13 redundant places. [2022-12-05 21:51:00,245 INFO L231 Difference]: Finished difference. Result has 214 places, 614 transitions, 6695 flow [2022-12-05 21:51:00,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3872, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=6695, PETRI_PLACES=214, PETRI_TRANSITIONS=614} [2022-12-05 21:51:00,246 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2022-12-05 21:51:00,246 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 614 transitions, 6695 flow [2022-12-05 21:51:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:00,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:00,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:51:00,257 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-05 21:51:00,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:00,448 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-05 21:51:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash -737555017, now seen corresponding path program 6 times [2022-12-05 21:51:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:00,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917971406] [2022-12-05 21:51:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:00,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:00,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917971406] [2022-12-05 21:51:00,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917971406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:00,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553835589] [2022-12-05 21:51:00,905 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:51:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:00,924 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-05 21:51:00,951 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-05 21:51:01,023 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-05 21:51:01,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:01,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-05 21:51:01,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:01,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-12-05 21:51:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:01,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:01,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:01,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 73 [2022-12-05 21:51:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:02,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553835589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:02,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:02,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 26 [2022-12-05 21:51:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268848512] [2022-12-05 21:51:02,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:02,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-05 21:51:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-05 21:51:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-12-05 21:51:02,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:51:02,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 614 transitions, 6695 flow. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:02,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:02,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:51:02,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:04,641 INFO L130 PetriNetUnfolder]: 5056/7883 cut-off events. [2022-12-05 21:51:04,642 INFO L131 PetriNetUnfolder]: For 68169/68169 co-relation queries the response was YES. [2022-12-05 21:51:04,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46475 conditions, 7883 events. 5056/7883 cut-off events. For 68169/68169 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 46818 event pairs, 1119 based on Foata normal form. 4/7887 useless extension candidates. Maximal degree in co-relation 46293. Up to 6778 conditions per place. [2022-12-05 21:51:04,702 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 516 selfloop transitions, 253 changer transitions 9/778 dead transitions. [2022-12-05 21:51:04,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 778 transitions, 9756 flow [2022-12-05 21:51:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-05 21:51:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-05 21:51:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 189 transitions. [2022-12-05 21:51:04,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-05 21:51:04,704 INFO L175 Difference]: Start difference. First operand has 214 places, 614 transitions, 6695 flow. Second operand 28 states and 189 transitions. [2022-12-05 21:51:04,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 778 transitions, 9756 flow [2022-12-05 21:51:05,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 778 transitions, 9235 flow, removed 212 selfloop flow, removed 13 redundant places. [2022-12-05 21:51:05,191 INFO L231 Difference]: Finished difference. Result has 236 places, 675 transitions, 7728 flow [2022-12-05 21:51:05,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7728, PETRI_PLACES=236, PETRI_TRANSITIONS=675} [2022-12-05 21:51:05,192 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2022-12-05 21:51:05,192 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 675 transitions, 7728 flow [2022-12-05 21:51:05,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:05,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:05,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:51:05,200 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-05 21:51:05,398 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,SelfDestructingSolverStorable8 [2022-12-05 21:51:05,398 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-05 21:51:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 208213433, now seen corresponding path program 7 times [2022-12-05 21:51:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:05,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343662700] [2022-12-05 21:51:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:05,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343662700] [2022-12-05 21:51:05,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343662700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:05,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669174060] [2022-12-05 21:51:05,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:51:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:05,853 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-05 21:51:05,873 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-05 21:51:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:05,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-05 21:51:05,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:05,982 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 11 treesize of output 7 [2022-12-05 21:51:06,029 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-05 21:51:06,068 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-05 21:51:06,107 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-05 21:51:06,301 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-05 21:51:06,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-05 21:51:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:06,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:07,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~min3~0 c_~min2~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse4 (<= c_~min2~0 c_~min3~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (< (select .cse1 .cse2) c_~min3~0) (= c_~min2~0 .cse0))))) .cse3) (or (and (or .cse4 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse3)) (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (or (< (select .cse6 .cse2) c_~min3~0) (< (select .cse6 c_~A~0.offset) c_~min1~0))))) (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse7 (select .cse9 c_~A~0.offset)) (.cse8 (select .cse9 .cse2))) (or (not (< .cse7 c_~min1~0)) (<= c_~min2~0 .cse8) (= .cse7 .cse8) (not (< .cse8 c_~min3~0)))))) (or .cse5 (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse2))) (or (< .cse10 c_~min2~0) (< (select .cse11 c_~A~0.offset) c_~min1~0) (not (< .cse10 c_~min3~0))))))) (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2))) (or (= c_~min1~0 .cse12) (<= c_~min2~0 .cse12) (< (select .cse13 c_~A~0.offset) c_~min1~0) (not (< .cse12 c_~min3~0)))))) (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset)) (.cse14 (select .cse16 .cse2))) (or (< .cse14 c_~min2~0) (not (< .cse15 c_~min1~0)) (= c_~min2~0 .cse15) (not (< .cse14 c_~min3~0)))))) (or .cse4 (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (not (< .cse17 c_~min1~0)) (< (select .cse18 .cse2) c_~min3~0) (= .cse17 c_~min3~0)))))))) is different from false [2022-12-05 21:51:07,148 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~min2~0 c_~min1~0)) (.cse7 (< c_~min3~0 c_~min2~0)) (.cse10 (<= c_~min2~0 c_~min3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 .cse3))) (or (= .cse0 .cse1) (not (< .cse0 c_~min1~0)) (<= c_~min2~0 .cse1) (not (< .cse1 c_~min3~0)))))) (or .cse4 (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse3))) (or (not (< .cse5 c_~min3~0)) (< (select .cse6 c_~A~0.offset) c_~min1~0) (< .cse5 c_~min2~0)))))) (or .cse7 (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (= c_~min2~0 .cse8) (not (< .cse8 c_~min1~0)) (< (select .cse9 .cse3) c_~min3~0)))))) (or (and (or .cse10 (= c_~min1~0 c_~min3~0)) (or .cse4 .cse7)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (or (< (select .cse11 .cse3) c_~min3~0) (< (select .cse11 c_~A~0.offset) c_~min1~0))))) (or .cse10 (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (not (< .cse12 c_~min1~0)) (= .cse12 c_~min3~0) (< (select .cse13 .cse3) c_~min3~0)))))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse14 (select .cse16 c_~A~0.offset)) (.cse15 (select .cse16 .cse3))) (or (= c_~min2~0 .cse14) (not (< .cse14 c_~min1~0)) (not (< .cse15 c_~min3~0)) (< .cse15 c_~min2~0))))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_426) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse3))) (or (= c_~min1~0 .cse17) (<= c_~min2~0 .cse17) (not (< .cse17 c_~min3~0)) (< (select .cse18 c_~A~0.offset) c_~min1~0))))))) is different from false [2022-12-05 21:51:08,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:08,144 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 90 treesize of output 66 [2022-12-05 21:51:08,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:08,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 781 treesize of output 759 [2022-12-05 21:51:08,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:08,165 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 749 treesize of output 679 [2022-12-05 21:51:08,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:08,178 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 669 treesize of output 659 [2022-12-05 21:51:08,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:08,191 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 649 treesize of output 619 [2022-12-05 21:51:09,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:09,237 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 90 treesize of output 66 [2022-12-05 21:51:09,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:09,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 369 [2022-12-05 21:51:09,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:09,260 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 359 treesize of output 329 [2022-12-05 21:51:09,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:09,273 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 319 treesize of output 309 [2022-12-05 21:51:09,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:09,286 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 205 treesize of output 205 [2022-12-05 21:51:11,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:11,297 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 126 treesize of output 90 [2022-12-05 21:51:11,341 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:11,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4694 treesize of output 4474 [2022-12-05 21:51:11,422 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:11,422 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 4470 treesize of output 4314 [2022-12-05 21:51:11,494 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:11,494 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 4310 treesize of output 3994 [2022-12-05 21:51:11,562 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:11,563 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 3990 treesize of output 3354 [2022-12-05 21:51:11,589 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 21:51:18,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:51:18,365 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 61 treesize of output 49 [2022-12-05 21:51:18,375 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:18,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 247 [2022-12-05 21:51:18,387 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:18,387 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 243 treesize of output 215 [2022-12-05 21:51:18,399 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:18,399 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 211 treesize of output 199 [2022-12-05 21:51:18,410 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-05 21:51:18,410 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 101 treesize of output 97 [2022-12-05 21:51:18,412 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 21:51:18,565 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 21:51:18,565 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 152 treesize of output 1 [2022-12-05 21:51:18,572 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 21:51:18,572 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 94 treesize of output 1 [2022-12-05 21:51:18,581 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 21:51:18,581 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 123 treesize of output 1 [2022-12-05 21:51:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:51:18,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669174060] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:18,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:18,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-12-05 21:51:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391857639] [2022-12-05 21:51:18,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:18,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-05 21:51:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-05 21:51:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=502, Unknown=2, NotChecked=94, Total=702 [2022-12-05 21:51:18,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:18,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 675 transitions, 7728 flow. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-05 21:51:18,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:18,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:18,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:20,836 INFO L130 PetriNetUnfolder]: 4907/7704 cut-off events. [2022-12-05 21:51:20,836 INFO L131 PetriNetUnfolder]: For 67824/68155 co-relation queries the response was YES. [2022-12-05 21:51:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46114 conditions, 7704 events. 4907/7704 cut-off events. For 67824/68155 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 46833 event pairs, 1114 based on Foata normal form. 130/7753 useless extension candidates. Maximal degree in co-relation 45916. Up to 6986 conditions per place. [2022-12-05 21:51:20,921 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 565 selfloop transitions, 131 changer transitions 1/724 dead transitions. [2022-12-05 21:51:20,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 724 transitions, 9683 flow [2022-12-05 21:51:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:51:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:51:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2022-12-05 21:51:20,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2022-12-05 21:51:20,922 INFO L175 Difference]: Start difference. First operand has 236 places, 675 transitions, 7728 flow. Second operand 11 states and 95 transitions. [2022-12-05 21:51:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 724 transitions, 9683 flow [2022-12-05 21:51:21,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 724 transitions, 9342 flow, removed 131 selfloop flow, removed 10 redundant places. [2022-12-05 21:51:21,305 INFO L231 Difference]: Finished difference. Result has 239 places, 689 transitions, 8025 flow [2022-12-05 21:51:21,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7467, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8025, PETRI_PLACES=239, PETRI_TRANSITIONS=689} [2022-12-05 21:51:21,307 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2022-12-05 21:51:21,307 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 689 transitions, 8025 flow [2022-12-05 21:51:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-05 21:51:21,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:21,307 INFO L213 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] [2022-12-05 21:51:21,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-05 21:51:21,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-05 21:51:21,511 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-05 21:51:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1367531197, now seen corresponding path program 8 times [2022-12-05 21:51:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:21,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120139707] [2022-12-05 21:51:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:21,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120139707] [2022-12-05 21:51:21,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120139707] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119709687] [2022-12-05 21:51:21,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:51:21,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:21,664 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-05 21:51:21,706 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-05 21:51:21,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:51:21,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:21,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:51:21,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:21,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:21,875 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-05 21:51:21,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119709687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:21,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:21,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-12-05 21:51:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835761779] [2022-12-05 21:51:21,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:21,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 21:51:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 21:51:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-12-05 21:51:21,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:51:21,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 689 transitions, 8025 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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-05 21:51:21,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:21,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:51:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:23,922 INFO L130 PetriNetUnfolder]: 6101/9581 cut-off events. [2022-12-05 21:51:23,922 INFO L131 PetriNetUnfolder]: For 95717/95717 co-relation queries the response was YES. [2022-12-05 21:51:23,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59862 conditions, 9581 events. 6101/9581 cut-off events. For 95717/95717 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 59224 event pairs, 1936 based on Foata normal form. 222/9803 useless extension candidates. Maximal degree in co-relation 59606. Up to 6384 conditions per place. [2022-12-05 21:51:24,006 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 745 selfloop transitions, 264 changer transitions 4/1013 dead transitions. [2022-12-05 21:51:24,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1013 transitions, 13679 flow [2022-12-05 21:51:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 21:51:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 21:51:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 195 transitions. [2022-12-05 21:51:24,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2022-12-05 21:51:24,007 INFO L175 Difference]: Start difference. First operand has 239 places, 689 transitions, 8025 flow. Second operand 22 states and 195 transitions. [2022-12-05 21:51:24,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 1013 transitions, 13679 flow [2022-12-05 21:51:24,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 1013 transitions, 13242 flow, removed 103 selfloop flow, removed 9 redundant places. [2022-12-05 21:51:24,585 INFO L231 Difference]: Finished difference. Result has 265 places, 820 transitions, 10578 flow [2022-12-05 21:51:24,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7401, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=10578, PETRI_PLACES=265, PETRI_TRANSITIONS=820} [2022-12-05 21:51:24,586 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 235 predicate places. [2022-12-05 21:51:24,586 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 820 transitions, 10578 flow [2022-12-05 21:51:24,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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-05 21:51:24,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:24,586 INFO L213 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] [2022-12-05 21:51:24,593 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-05 21:51:24,787 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,SelfDestructingSolverStorable10 [2022-12-05 21:51:24,787 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-05 21:51:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 577822272, now seen corresponding path program 9 times [2022-12-05 21:51:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856810692] [2022-12-05 21:51:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856810692] [2022-12-05 21:51:24,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856810692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315193631] [2022-12-05 21:51:24,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:51:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:24,885 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-05 21:51:24,886 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-05 21:51:25,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 21:51:25,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:25,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:51:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:25,060 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-05 21:51:25,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:25,103 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-05 21:51:25,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315193631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:25,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:25,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-05 21:51:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849081175] [2022-12-05 21:51:25,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:25,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 21:51:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 21:51:25,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-05 21:51:25,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 21:51:25,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 820 transitions, 10578 flow. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-05 21:51:25,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:25,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 21:51:25,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:26,721 INFO L130 PetriNetUnfolder]: 4600/7365 cut-off events. [2022-12-05 21:51:26,722 INFO L131 PetriNetUnfolder]: For 161487/162942 co-relation queries the response was YES. [2022-12-05 21:51:26,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55692 conditions, 7365 events. 4600/7365 cut-off events. For 161487/162942 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 46368 event pairs, 1022 based on Foata normal form. 644/7731 useless extension candidates. Maximal degree in co-relation 55530. Up to 3539 conditions per place. [2022-12-05 21:51:26,795 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 677 selfloop transitions, 61 changer transitions 7/807 dead transitions. [2022-12-05 21:51:26,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 807 transitions, 11882 flow [2022-12-05 21:51:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 21:51:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 21:51:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-05 21:51:26,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 21:51:26,797 INFO L175 Difference]: Start difference. First operand has 265 places, 820 transitions, 10578 flow. Second operand 8 states and 88 transitions. [2022-12-05 21:51:26,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 807 transitions, 11882 flow [2022-12-05 21:51:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 807 transitions, 11317 flow, removed 256 selfloop flow, removed 5 redundant places. [2022-12-05 21:51:27,343 INFO L231 Difference]: Finished difference. Result has 269 places, 704 transitions, 8753 flow [2022-12-05 21:51:27,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8519, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8753, PETRI_PLACES=269, PETRI_TRANSITIONS=704} [2022-12-05 21:51:27,344 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2022-12-05 21:51:27,344 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 704 transitions, 8753 flow [2022-12-05 21:51:27,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-05 21:51:27,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:27,344 INFO L213 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] [2022-12-05 21:51:27,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-05 21:51:27,549 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,SelfDestructingSolverStorable11 [2022-12-05 21:51:27,549 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-05 21:51:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 414939754, now seen corresponding path program 10 times [2022-12-05 21:51:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:27,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764942454] [2022-12-05 21:51:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:27,703 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-05 21:51:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764942454] [2022-12-05 21:51:27,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764942454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777957483] [2022-12-05 21:51:27,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:51:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:27,713 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-05 21:51:27,715 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-05 21:51:27,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:51:27,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:27,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 21:51:27,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:27,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:27,960 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-05 21:51:27,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777957483] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:27,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:27,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2022-12-05 21:51:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891800959] [2022-12-05 21:51:27,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:51:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:51:27,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:51:27,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:27,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 704 transitions, 8753 flow. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-05 21:51:27,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:27,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:27,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:30,084 INFO L130 PetriNetUnfolder]: 4765/7775 cut-off events. [2022-12-05 21:51:30,084 INFO L131 PetriNetUnfolder]: For 158399/158662 co-relation queries the response was YES. [2022-12-05 21:51:30,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59275 conditions, 7775 events. 4765/7775 cut-off events. For 158399/158662 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 50381 event pairs, 743 based on Foata normal form. 506/8234 useless extension candidates. Maximal degree in co-relation 59133. Up to 3221 conditions per place. [2022-12-05 21:51:30,162 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 615 selfloop transitions, 278 changer transitions 25/952 dead transitions. [2022-12-05 21:51:30,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 952 transitions, 14250 flow [2022-12-05 21:51:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 21:51:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 21:51:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 219 transitions. [2022-12-05 21:51:30,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3146551724137931 [2022-12-05 21:51:30,164 INFO L175 Difference]: Start difference. First operand has 269 places, 704 transitions, 8753 flow. Second operand 29 states and 219 transitions. [2022-12-05 21:51:30,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 952 transitions, 14250 flow [2022-12-05 21:51:30,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 952 transitions, 14069 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-05 21:51:30,824 INFO L231 Difference]: Finished difference. Result has 302 places, 748 transitions, 10737 flow [2022-12-05 21:51:30,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8319, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10737, PETRI_PLACES=302, PETRI_TRANSITIONS=748} [2022-12-05 21:51:30,825 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2022-12-05 21:51:30,825 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 748 transitions, 10737 flow [2022-12-05 21:51:30,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-05 21:51:30,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:30,825 INFO L213 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-05 21:51:30,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-05 21:51:31,029 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,SelfDestructingSolverStorable12 [2022-12-05 21:51:31,030 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-05 21:51:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2139893273, now seen corresponding path program 1 times [2022-12-05 21:51:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:31,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812156029] [2022-12-05 21:51:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812156029] [2022-12-05 21:51:31,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812156029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490090086] [2022-12-05 21:51:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:31,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:31,114 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-05 21:51:31,140 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-05 21:51:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:31,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 21:51:31,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:31,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:31,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490090086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:31,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:31,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-05 21:51:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64996894] [2022-12-05 21:51:31,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:31,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 21:51:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 21:51:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-05 21:51:31,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:31,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 748 transitions, 10737 flow. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 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-05 21:51:31,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:31,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:31,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:33,694 INFO L130 PetriNetUnfolder]: 5525/9257 cut-off events. [2022-12-05 21:51:33,694 INFO L131 PetriNetUnfolder]: For 210025/210124 co-relation queries the response was YES. [2022-12-05 21:51:33,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73672 conditions, 9257 events. 5525/9257 cut-off events. For 210025/210124 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 64708 event pairs, 494 based on Foata normal form. 275/9523 useless extension candidates. Maximal degree in co-relation 73329. Up to 3672 conditions per place. [2022-12-05 21:51:33,883 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 826 selfloop transitions, 263 changer transitions 140/1257 dead transitions. [2022-12-05 21:51:33,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1257 transitions, 20639 flow [2022-12-05 21:51:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 21:51:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 21:51:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2022-12-05 21:51:33,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-05 21:51:33,885 INFO L175 Difference]: Start difference. First operand has 302 places, 748 transitions, 10737 flow. Second operand 20 states and 205 transitions. [2022-12-05 21:51:33,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1257 transitions, 20639 flow [2022-12-05 21:51:35,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1257 transitions, 19277 flow, removed 620 selfloop flow, removed 8 redundant places. [2022-12-05 21:51:35,029 INFO L231 Difference]: Finished difference. Result has 316 places, 814 transitions, 11933 flow [2022-12-05 21:51:35,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9944, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11933, PETRI_PLACES=316, PETRI_TRANSITIONS=814} [2022-12-05 21:51:35,030 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2022-12-05 21:51:35,030 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 814 transitions, 11933 flow [2022-12-05 21:51:35,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 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-05 21:51:35,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:35,030 INFO L213 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-05 21:51:35,037 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-05 21:51:35,235 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,SelfDestructingSolverStorable13 [2022-12-05 21:51:35,235 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-05 21:51:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1893175999, now seen corresponding path program 2 times [2022-12-05 21:51:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:35,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024346245] [2022-12-05 21:51:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024346245] [2022-12-05 21:51:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024346245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:35,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660320015] [2022-12-05 21:51:35,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:51:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:35,378 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-05 21:51:35,379 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-05 21:51:35,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:51:35,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:35,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 21:51:35,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:35,526 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-05 21:51:35,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:35,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660320015] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:35,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:35,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-12-05 21:51:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384761345] [2022-12-05 21:51:35,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:35,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:51:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:51:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:51:35,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:51:35,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 814 transitions, 11933 flow. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:35,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:35,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:51:35,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:39,658 INFO L130 PetriNetUnfolder]: 6889/11605 cut-off events. [2022-12-05 21:51:39,658 INFO L131 PetriNetUnfolder]: For 254090/254090 co-relation queries the response was YES. [2022-12-05 21:51:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95265 conditions, 11605 events. 6889/11605 cut-off events. For 254090/254090 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 83547 event pairs, 830 based on Foata normal form. 158/11763 useless extension candidates. Maximal degree in co-relation 95027. Up to 5189 conditions per place. [2022-12-05 21:51:39,785 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 818 selfloop transitions, 715 changer transitions 94/1627 dead transitions. [2022-12-05 21:51:39,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1627 transitions, 27243 flow [2022-12-05 21:51:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-05 21:51:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-12-05 21:51:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 368 transitions. [2022-12-05 21:51:39,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2022-12-05 21:51:39,787 INFO L175 Difference]: Start difference. First operand has 316 places, 814 transitions, 11933 flow. Second operand 54 states and 368 transitions. [2022-12-05 21:51:39,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1627 transitions, 27243 flow [2022-12-05 21:51:42,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1627 transitions, 25457 flow, removed 741 selfloop flow, removed 8 redundant places. [2022-12-05 21:51:42,247 INFO L231 Difference]: Finished difference. Result has 375 places, 1182 transitions, 18995 flow [2022-12-05 21:51:42,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=11261, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=18995, PETRI_PLACES=375, PETRI_TRANSITIONS=1182} [2022-12-05 21:51:42,248 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 345 predicate places. [2022-12-05 21:51:42,248 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 1182 transitions, 18995 flow [2022-12-05 21:51:42,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:42,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:42,248 INFO L213 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-05 21:51:42,258 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-05 21:51:42,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:42,453 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-05 21:51:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 190200033, now seen corresponding path program 3 times [2022-12-05 21:51:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456505438] [2022-12-05 21:51:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456505438] [2022-12-05 21:51:42,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456505438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103857332] [2022-12-05 21:51:42,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:51:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:42,526 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-05 21:51:42,528 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-05 21:51:42,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 21:51:42,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:42,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 21:51:42,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:42,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:42,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103857332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:42,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:42,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-05 21:51:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008617702] [2022-12-05 21:51:42,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:42,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 21:51:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 21:51:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-05 21:51:42,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:42,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1182 transitions, 18995 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-05 21:51:42,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:42,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:44,901 INFO L130 PetriNetUnfolder]: 4314/7284 cut-off events. [2022-12-05 21:51:44,901 INFO L131 PetriNetUnfolder]: For 161663/161668 co-relation queries the response was YES. [2022-12-05 21:51:44,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62201 conditions, 7284 events. 4314/7284 cut-off events. For 161663/161668 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 48571 event pairs, 354 based on Foata normal form. 431/7707 useless extension candidates. Maximal degree in co-relation 62086. Up to 3740 conditions per place. [2022-12-05 21:51:44,983 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 772 selfloop transitions, 99 changer transitions 142/1041 dead transitions. [2022-12-05 21:51:44,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1041 transitions, 18922 flow [2022-12-05 21:51:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 21:51:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 21:51:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-12-05 21:51:44,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2022-12-05 21:51:44,985 INFO L175 Difference]: Start difference. First operand has 375 places, 1182 transitions, 18995 flow. Second operand 11 states and 98 transitions. [2022-12-05 21:51:44,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1041 transitions, 18922 flow [2022-12-05 21:51:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1041 transitions, 18174 flow, removed 253 selfloop flow, removed 30 redundant places. [2022-12-05 21:51:45,888 INFO L231 Difference]: Finished difference. Result has 318 places, 730 transitions, 11853 flow [2022-12-05 21:51:45,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=13112, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11853, PETRI_PLACES=318, PETRI_TRANSITIONS=730} [2022-12-05 21:51:45,889 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2022-12-05 21:51:45,889 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 730 transitions, 11853 flow [2022-12-05 21:51:45,889 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-05 21:51:45,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:45,889 INFO L213 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] [2022-12-05 21:51:45,900 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-05 21:51:46,093 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,SelfDestructingSolverStorable15 [2022-12-05 21:51:46,094 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-05 21:51:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1768514758, now seen corresponding path program 11 times [2022-12-05 21:51:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129579301] [2022-12-05 21:51:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:46,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129579301] [2022-12-05 21:51:46,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129579301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860785173] [2022-12-05 21:51:46,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:51:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:46,186 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-05 21:51:46,187 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-05 21:51:46,291 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 21:51:46,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:46,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:51:46,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:51:46,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:51:46,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860785173] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:46,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:46,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-12-05 21:51:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6435124] [2022-12-05 21:51:46,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:46,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-05 21:51:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-05 21:51:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-12-05 21:51:46,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:51:46,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 730 transitions, 11853 flow. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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-05 21:51:46,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:46,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:51:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:49,677 INFO L130 PetriNetUnfolder]: 4367/7195 cut-off events. [2022-12-05 21:51:49,677 INFO L131 PetriNetUnfolder]: For 172514/172514 co-relation queries the response was YES. [2022-12-05 21:51:49,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63582 conditions, 7195 events. 4367/7195 cut-off events. For 172514/172514 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 46088 event pairs, 100 based on Foata normal form. 110/7305 useless extension candidates. Maximal degree in co-relation 63486. Up to 3956 conditions per place. [2022-12-05 21:51:49,757 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 795 selfloop transitions, 507 changer transitions 0/1302 dead transitions. [2022-12-05 21:51:49,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1302 transitions, 23632 flow [2022-12-05 21:51:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-05 21:51:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-05 21:51:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 344 transitions. [2022-12-05 21:51:49,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2986111111111111 [2022-12-05 21:51:49,759 INFO L175 Difference]: Start difference. First operand has 318 places, 730 transitions, 11853 flow. Second operand 48 states and 344 transitions. [2022-12-05 21:51:49,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1302 transitions, 23632 flow [2022-12-05 21:51:50,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1302 transitions, 21931 flow, removed 635 selfloop flow, removed 14 redundant places. [2022-12-05 21:51:50,599 INFO L231 Difference]: Finished difference. Result has 302 places, 920 transitions, 15975 flow [2022-12-05 21:51:50,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=10777, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=15975, PETRI_PLACES=302, PETRI_TRANSITIONS=920} [2022-12-05 21:51:50,600 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2022-12-05 21:51:50,600 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 920 transitions, 15975 flow [2022-12-05 21:51:50,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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-05 21:51:50,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:50,600 INFO L213 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] [2022-12-05 21:51:50,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-05 21:51:50,804 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,SelfDestructingSolverStorable16 [2022-12-05 21:51:50,805 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-05 21:51:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 694676344, now seen corresponding path program 12 times [2022-12-05 21:51:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:50,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860678265] [2022-12-05 21:51:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860678265] [2022-12-05 21:51:50,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860678265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171421506] [2022-12-05 21:51:50,908 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:51:50,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:50,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:50,911 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-05 21:51:50,913 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-05 21:51:51,023 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-05 21:51:51,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:51,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:51:51,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:51,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:51,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171421506] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:51,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:51,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-05 21:51:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405620415] [2022-12-05 21:51:51,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:51,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-05 21:51:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-05 21:51:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-12-05 21:51:51,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:51,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 920 transitions, 15975 flow. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:51,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:51,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:51,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:53,447 INFO L130 PetriNetUnfolder]: 4393/7188 cut-off events. [2022-12-05 21:51:53,447 INFO L131 PetriNetUnfolder]: For 242322/242322 co-relation queries the response was YES. [2022-12-05 21:51:53,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67805 conditions, 7188 events. 4393/7188 cut-off events. For 242322/242322 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 45644 event pairs, 612 based on Foata normal form. 34/7215 useless extension candidates. Maximal degree in co-relation 67695. Up to 4004 conditions per place. [2022-12-05 21:51:53,531 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 745 selfloop transitions, 292 changer transitions 0/1063 dead transitions. [2022-12-05 21:51:53,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1063 transitions, 20488 flow [2022-12-05 21:51:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 21:51:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 21:51:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-05 21:51:53,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-05 21:51:53,532 INFO L175 Difference]: Start difference. First operand has 302 places, 920 transitions, 15975 flow. Second operand 10 states and 93 transitions. [2022-12-05 21:51:53,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1063 transitions, 20488 flow [2022-12-05 21:51:55,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 1063 transitions, 19248 flow, removed 616 selfloop flow, removed 4 redundant places. [2022-12-05 21:51:55,018 INFO L231 Difference]: Finished difference. Result has 309 places, 932 transitions, 15861 flow [2022-12-05 21:51:55,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=14600, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15861, PETRI_PLACES=309, PETRI_TRANSITIONS=932} [2022-12-05 21:51:55,019 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 279 predicate places. [2022-12-05 21:51:55,019 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 932 transitions, 15861 flow [2022-12-05 21:51:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:55,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:55,019 INFO L213 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] [2022-12-05 21:51:55,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-05 21:51:55,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-05 21:51:55,224 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-05 21:51:55,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -871463226, now seen corresponding path program 13 times [2022-12-05 21:51:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:55,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271166056] [2022-12-05 21:51:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271166056] [2022-12-05 21:51:55,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271166056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947989092] [2022-12-05 21:51:55,401 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 21:51:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:55,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:55,416 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-05 21:51:55,424 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-05 21:51:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:55,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:51:55,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:55,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:55,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947989092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:55,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:55,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-05 21:51:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535105469] [2022-12-05 21:51:55,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:55,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:51:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:51:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:51:55,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:55,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 932 transitions, 15861 flow. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:55,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:55,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:55,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:51:57,750 INFO L130 PetriNetUnfolder]: 4461/7312 cut-off events. [2022-12-05 21:51:57,751 INFO L131 PetriNetUnfolder]: For 275743/275746 co-relation queries the response was YES. [2022-12-05 21:51:57,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68737 conditions, 7312 events. 4461/7312 cut-off events. For 275743/275746 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 46587 event pairs, 1010 based on Foata normal form. 58/7360 useless extension candidates. Maximal degree in co-relation 68626. Up to 5751 conditions per place. [2022-12-05 21:51:57,835 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 790 selfloop transitions, 217 changer transitions 0/1033 dead transitions. [2022-12-05 21:51:57,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1033 transitions, 19382 flow [2022-12-05 21:51:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:51:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:51:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-12-05 21:51:57,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-05 21:51:57,837 INFO L175 Difference]: Start difference. First operand has 309 places, 932 transitions, 15861 flow. Second operand 9 states and 70 transitions. [2022-12-05 21:51:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1033 transitions, 19382 flow [2022-12-05 21:51:59,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1033 transitions, 18867 flow, removed 57 selfloop flow, removed 7 redundant places. [2022-12-05 21:51:59,087 INFO L231 Difference]: Finished difference. Result has 312 places, 956 transitions, 16302 flow [2022-12-05 21:51:59,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=15360, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16302, PETRI_PLACES=312, PETRI_TRANSITIONS=956} [2022-12-05 21:51:59,088 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2022-12-05 21:51:59,088 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 956 transitions, 16302 flow [2022-12-05 21:51:59,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:51:59,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:51:59,088 INFO L213 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] [2022-12-05 21:51:59,092 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-05 21:51:59,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:59,293 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-05 21:51:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:51:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 484777460, now seen corresponding path program 14 times [2022-12-05 21:51:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:51:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764584031] [2022-12-05 21:51:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:51:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:51:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:51:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:51:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764584031] [2022-12-05 21:51:59,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764584031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:51:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118717012] [2022-12-05 21:51:59,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:51:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:51:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:51:59,389 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-05 21:51:59,418 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-05 21:51:59,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:51:59,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:51:59,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:51:59,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:51:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:59,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:51:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:51:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118717012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:51:59,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:51:59,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-05 21:51:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822113341] [2022-12-05 21:51:59,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:51:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 21:51:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:51:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 21:51:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-05 21:51:59,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:51:59,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 956 transitions, 16302 flow. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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-05 21:51:59,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:51:59,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:51:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:52:02,361 INFO L130 PetriNetUnfolder]: 5246/8660 cut-off events. [2022-12-05 21:52:02,361 INFO L131 PetriNetUnfolder]: For 316509/316512 co-relation queries the response was YES. [2022-12-05 21:52:02,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81533 conditions, 8660 events. 5246/8660 cut-off events. For 316509/316512 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 57246 event pairs, 1021 based on Foata normal form. 48/8702 useless extension candidates. Maximal degree in co-relation 81421. Up to 5898 conditions per place. [2022-12-05 21:52:02,461 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 952 selfloop transitions, 298 changer transitions 0/1276 dead transitions. [2022-12-05 21:52:02,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 1276 transitions, 24087 flow [2022-12-05 21:52:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 21:52:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 21:52:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-12-05 21:52:02,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-05 21:52:02,462 INFO L175 Difference]: Start difference. First operand has 312 places, 956 transitions, 16302 flow. Second operand 15 states and 132 transitions. [2022-12-05 21:52:02,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 1276 transitions, 24087 flow [2022-12-05 21:52:04,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1276 transitions, 23748 flow, removed 57 selfloop flow, removed 6 redundant places. [2022-12-05 21:52:04,207 INFO L231 Difference]: Finished difference. Result has 325 places, 1036 transitions, 18384 flow [2022-12-05 21:52:04,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=15976, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=18384, PETRI_PLACES=325, PETRI_TRANSITIONS=1036} [2022-12-05 21:52:04,208 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 295 predicate places. [2022-12-05 21:52:04,208 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 1036 transitions, 18384 flow [2022-12-05 21:52:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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-05 21:52:04,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:52:04,208 INFO L213 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] [2022-12-05 21:52:04,213 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-05 21:52:04,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:04,413 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-05 21:52:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:52:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2090963724, now seen corresponding path program 15 times [2022-12-05 21:52:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:52:04,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141333538] [2022-12-05 21:52:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:52:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:52:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:52:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:04,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:52:04,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141333538] [2022-12-05 21:52:04,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141333538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:52:04,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745970635] [2022-12-05 21:52:04,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 21:52:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:52:04,503 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-05 21:52:04,506 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-05 21:52:04,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 21:52:04,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:52:04,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:52:04,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:52:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:04,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:52:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:04,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745970635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:52:04,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:52:04,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-05 21:52:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772225410] [2022-12-05 21:52:04,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:52:04,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 21:52:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:52:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 21:52:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-05 21:52:04,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:52:04,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 1036 transitions, 18384 flow. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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-05 21:52:04,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:52:04,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:52:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:52:08,475 INFO L130 PetriNetUnfolder]: 6835/11280 cut-off events. [2022-12-05 21:52:08,476 INFO L131 PetriNetUnfolder]: For 448553/448556 co-relation queries the response was YES. [2022-12-05 21:52:08,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112428 conditions, 11280 events. 6835/11280 cut-off events. For 448553/448556 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 77679 event pairs, 770 based on Foata normal form. 48/11322 useless extension candidates. Maximal degree in co-relation 112313. Up to 6167 conditions per place. [2022-12-05 21:52:08,623 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 1022 selfloop transitions, 482 changer transitions 0/1530 dead transitions. [2022-12-05 21:52:08,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1530 transitions, 29943 flow [2022-12-05 21:52:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 21:52:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 21:52:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 170 transitions. [2022-12-05 21:52:08,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39351851851851855 [2022-12-05 21:52:08,625 INFO L175 Difference]: Start difference. First operand has 325 places, 1036 transitions, 18384 flow. Second operand 18 states and 170 transitions. [2022-12-05 21:52:08,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1530 transitions, 29943 flow [2022-12-05 21:52:11,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1530 transitions, 29391 flow, removed 161 selfloop flow, removed 5 redundant places. [2022-12-05 21:52:11,392 INFO L231 Difference]: Finished difference. Result has 343 places, 1146 transitions, 21937 flow [2022-12-05 21:52:11,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=17810, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=21937, PETRI_PLACES=343, PETRI_TRANSITIONS=1146} [2022-12-05 21:52:11,393 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 313 predicate places. [2022-12-05 21:52:11,393 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1146 transitions, 21937 flow [2022-12-05 21:52:11,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 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-05 21:52:11,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:52:11,393 INFO L213 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] [2022-12-05 21:52:11,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-05 21:52:11,598 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,SelfDestructingSolverStorable20 [2022-12-05 21:52:11,598 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-05 21:52:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:52:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -636766156, now seen corresponding path program 16 times [2022-12-05 21:52:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:52:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943322800] [2022-12-05 21:52:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:52:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:52:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:52:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:52:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:52:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943322800] [2022-12-05 21:52:11,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943322800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:52:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683038624] [2022-12-05 21:52:11,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:52:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:52:11,692 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-05 21:52:11,693 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-05 21:52:11,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:52:11,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:52:11,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:52:11,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:52:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:52:11,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:52:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:52:11,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683038624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:52:11,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:52:11,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-12-05 21:52:11,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857881567] [2022-12-05 21:52:11,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:52:11,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:52:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:52:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:52:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:52:11,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:52:11,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1146 transitions, 21937 flow. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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-05 21:52:11,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:52:11,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:52:11,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:52:18,788 INFO L130 PetriNetUnfolder]: 10563/17481 cut-off events. [2022-12-05 21:52:18,788 INFO L131 PetriNetUnfolder]: For 807380/807380 co-relation queries the response was YES. [2022-12-05 21:52:18,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186047 conditions, 17481 events. 10563/17481 cut-off events. For 807380/807380 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 128910 event pairs, 340 based on Foata normal form. 68/17549 useless extension candidates. Maximal degree in co-relation 185926. Up to 9276 conditions per place. [2022-12-05 21:52:19,050 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 1159 selfloop transitions, 964 changer transitions 0/2123 dead transitions. [2022-12-05 21:52:19,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 2123 transitions, 48117 flow [2022-12-05 21:52:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-05 21:52:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-05 21:52:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 310 transitions. [2022-12-05 21:52:19,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3311965811965812 [2022-12-05 21:52:19,051 INFO L175 Difference]: Start difference. First operand has 343 places, 1146 transitions, 21937 flow. Second operand 39 states and 310 transitions. [2022-12-05 21:52:19,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 2123 transitions, 48117 flow [2022-12-05 21:52:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 2123 transitions, 45546 flow, removed 1096 selfloop flow, removed 9 redundant places. [2022-12-05 21:52:26,622 INFO L231 Difference]: Finished difference. Result has 388 places, 1560 transitions, 35403 flow [2022-12-05 21:52:26,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=20977, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=35403, PETRI_PLACES=388, PETRI_TRANSITIONS=1560} [2022-12-05 21:52:26,623 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 358 predicate places. [2022-12-05 21:52:26,623 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 1560 transitions, 35403 flow [2022-12-05 21:52:26,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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-05 21:52:26,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:52:26,623 INFO L213 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] [2022-12-05 21:52:26,641 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-05 21:52:26,842 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,SelfDestructingSolverStorable21 [2022-12-05 21:52:26,842 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-05 21:52:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:52:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1285142480, now seen corresponding path program 17 times [2022-12-05 21:52:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:52:26,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95407935] [2022-12-05 21:52:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:52:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:52:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:52:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:52:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:52:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95407935] [2022-12-05 21:52:26,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95407935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:52:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445557342] [2022-12-05 21:52:26,926 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 21:52:26,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:26,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:52:26,928 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:52:26,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-05 21:52:27,023 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 21:52:27,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:52:27,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 21:52:27,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:52:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:52:27,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:52:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:52:27,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445557342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:52:27,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:52:27,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-12-05 21:52:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895610181] [2022-12-05 21:52:27,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:52:27,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-05 21:52:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:52:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-05 21:52:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-12-05 21:52:27,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 21:52:27,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1560 transitions, 35403 flow. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-05 21:52:27,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:52:27,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 21:52:27,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:52:38,630 INFO L130 PetriNetUnfolder]: 12873/21222 cut-off events. [2022-12-05 21:52:38,630 INFO L131 PetriNetUnfolder]: For 1024789/1024789 co-relation queries the response was YES. [2022-12-05 21:52:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233998 conditions, 21222 events. 12873/21222 cut-off events. For 1024789/1024789 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 160042 event pairs, 209 based on Foata normal form. 124/21346 useless extension candidates. Maximal degree in co-relation 233861. Up to 11448 conditions per place. [2022-12-05 21:52:39,021 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 1352 selfloop transitions, 1442 changer transitions 0/2794 dead transitions. [2022-12-05 21:52:39,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 2794 transitions, 63990 flow [2022-12-05 21:52:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-05 21:52:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-12-05 21:52:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 633 transitions. [2022-12-05 21:52:39,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3663194444444444 [2022-12-05 21:52:39,026 INFO L175 Difference]: Start difference. First operand has 388 places, 1560 transitions, 35403 flow. Second operand 72 states and 633 transitions. [2022-12-05 21:52:39,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 2794 transitions, 63990 flow [2022-12-05 21:52:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 2794 transitions, 59346 flow, removed 2168 selfloop flow, removed 6 redundant places. [2022-12-05 21:52:52,685 INFO L231 Difference]: Finished difference. Result has 470 places, 1994 transitions, 46548 flow [2022-12-05 21:52:52,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=32026, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=46548, PETRI_PLACES=470, PETRI_TRANSITIONS=1994} [2022-12-05 21:52:52,686 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 440 predicate places. [2022-12-05 21:52:52,686 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 1994 transitions, 46548 flow [2022-12-05 21:52:52,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-05 21:52:52,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:52:52,686 INFO L213 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] [2022-12-05 21:52:52,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-05 21:52:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:52,892 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:52:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:52:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -539784914, now seen corresponding path program 18 times [2022-12-05 21:52:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:52:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034008422] [2022-12-05 21:52:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:52:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:52:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:52:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:52:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034008422] [2022-12-05 21:52:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034008422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:52:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129843009] [2022-12-05 21:52:52,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 21:52:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:52:52,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:52:53,000 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:52:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-05 21:52:53,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-05 21:52:53,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:52:53,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 21:52:53,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:52:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:53,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:52:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 21:52:53,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129843009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:52:53,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:52:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-05 21:52:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672238172] [2022-12-05 21:52:53,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:52:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-05 21:52:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:52:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-05 21:52:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-05 21:52:53,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 21:52:53,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1994 transitions, 46548 flow. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 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-05 21:52:53,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:52:53,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 21:52:53,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:53:04,589 INFO L130 PetriNetUnfolder]: 12564/20598 cut-off events. [2022-12-05 21:53:04,589 INFO L131 PetriNetUnfolder]: For 907835/907835 co-relation queries the response was YES. [2022-12-05 21:53:04,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225305 conditions, 20598 events. 12564/20598 cut-off events. For 907835/907835 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 153286 event pairs, 2556 based on Foata normal form. 196/20787 useless extension candidates. Maximal degree in co-relation 225151. Up to 13120 conditions per place. [2022-12-05 21:53:04,998 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 1516 selfloop transitions, 509 changer transitions 0/2072 dead transitions. [2022-12-05 21:53:04,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 2072 transitions, 52324 flow [2022-12-05 21:53:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 21:53:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 21:53:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-12-05 21:53:05,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-05 21:53:05,005 INFO L175 Difference]: Start difference. First operand has 470 places, 1994 transitions, 46548 flow. Second operand 9 states and 77 transitions. [2022-12-05 21:53:05,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 2072 transitions, 52324 flow [2022-12-05 21:53:18,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 2072 transitions, 49238 flow, removed 1290 selfloop flow, removed 18 redundant places. [2022-12-05 21:53:18,872 INFO L231 Difference]: Finished difference. Result has 457 places, 1959 transitions, 43915 flow [2022-12-05 21:53:18,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42412, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=495, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=43915, PETRI_PLACES=457, PETRI_TRANSITIONS=1959} [2022-12-05 21:53:18,874 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 427 predicate places. [2022-12-05 21:53:18,874 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 1959 transitions, 43915 flow [2022-12-05 21:53:18,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 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-05 21:53:18,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:53:18,874 INFO L213 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] [2022-12-05 21:53:18,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-05 21:53:19,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:53:19,079 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 21:53:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:53:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash -220410354, now seen corresponding path program 4 times [2022-12-05 21:53:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:53:19,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058510928] [2022-12-05 21:53:19,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:53:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:53:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:53:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:53:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:53:20,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058510928] [2022-12-05 21:53:20,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058510928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:53:20,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616486648] [2022-12-05 21:53:20,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 21:53:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:53:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:53:20,173 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:53:20,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-05 21:53:20,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 21:53:20,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:53:20,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-05 21:53:20,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:53:20,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 21:53:20,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-05 21:53:20,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 21:53:20,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-05 21:53:20,960 INFO L321 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2022-12-05 21:53:20,961 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 134 treesize of output 120 [2022-12-05 21:53:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 21:53:21,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:53:23,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~min3~0 1))) (let ((.cse13 (<= .cse7 c_~min2~0)) (.cse10 (<= c_~min2~0 c_~min3~0)) (.cse9 (= c_~min2~0 c_~min1~0)) (.cse12 (= c_~min1~0 c_~min3~0)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse1) (not (< 0 ~M~0)) (= .cse0 .cse1) (< 1 ~M~0) (not (< .cse1 c_~min3~0))))) (< (select .cse2 c_~A~0.offset) c_~min2~0))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (not (< .cse4 c_~min1~0)) (= .cse4 c_~min3~0) (= c_~min2~0 .cse4) (< (select .cse5 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse5 c_~A~0.offset) c_~min2~0))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse8 (select .cse6 c_~A~0.offset))) (or (< (select .cse6 .cse3) c_~min1~0) (<= .cse7 .cse8) (= c_~min1~0 .cse8) (not (< .cse8 c_~min2~0)) (< (select .cse6 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))) (< 1 ~M~0))) (or (and .cse9 .cse10) (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (or (< (select .cse11 .cse3) c_~min1~0) (not (< 0 ~M~0)) (< (select .cse11 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse11 c_~A~0.offset) c_~min2~0) (< 1 ~M~0)))) (and .cse12 .cse13)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse14 (select .cse17 .cse3)) (.cse15 (select .cse17 c_~A~0.offset))) (or (not (< .cse14 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse15 .cse16) (= .cse14 .cse16) (< 1 ~M~0) (not (< .cse16 c_~min3~0))))) (not (< .cse15 c_~min2~0)))))) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse3)) (.cse19 (select .cse20 c_~A~0.offset))) (or (not (< .cse18 c_~min1~0)) (= .cse18 c_~min3~0) (not (< .cse19 c_~min2~0)) (< (select .cse20 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (<= .cse19 c_~min3~0))))) (< 1 ~M~0))) (or .cse13 (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse3))) (or (not (< .cse21 c_~min1~0)) (not (< 0 ~M~0)) (= c_~min2~0 .cse21) (< (select .cse22 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse22 c_~A~0.offset) c_~min2~0) (< 1 ~M~0)))))) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse3)) (.cse24 (select .cse25 c_~A~0.offset))) (or (not (< .cse23 c_~min1~0)) (<= .cse7 .cse24) (not (< .cse24 c_~min2~0)) (= .cse23 .cse24) (< (select .cse25 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))) (< 1 ~M~0))) (or (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse27 (select .cse26 c_~A~0.offset))) (or (< (select .cse26 .cse3) c_~min1~0) (not (< 0 ~M~0)) (= c_~min1~0 .cse27) (not (< .cse27 c_~min2~0)) (< (select .cse26 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 1 ~M~0))))) .cse12) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse29 (select .cse28 c_~A~0.offset))) (or (< (select .cse28 .cse3) c_~min1~0) (not (< .cse29 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse30 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= .cse29 .cse30) (= c_~min1~0 .cse30) (< 1 ~M~0) (not (< .cse30 c_~min3~0))))))))) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (or (< (select .cse31 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse32 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse32) (not (< 0 ~M~0)) (= c_~min1~0 .cse32) (< 1 ~M~0) (not (< .cse32 c_~min3~0))))) (< (select .cse31 c_~A~0.offset) c_~min2~0)))) (or .cse10 (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse3))) (or (not (< .cse33 c_~min1~0)) (not (< 0 ~M~0)) (= .cse33 c_~min3~0) (< (select .cse34 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse34 c_~A~0.offset) c_~min2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse37 (select .cse35 c_~A~0.offset))) (or (< (select .cse35 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse36 (select .cse35 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= (+ .cse36 1) .cse37) (< 1 ~M~0) (not (< .cse36 c_~min3~0))))) (= c_~min1~0 .cse37) (not (< .cse37 c_~min2~0)))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse38 (select .cse40 .cse3)) (.cse39 (select .cse40 c_~A~0.offset))) (or (not (< .cse38 c_~min1~0)) (= .cse38 c_~min3~0) (not (< .cse39 c_~min2~0)) (= .cse38 .cse39) (< (select .cse40 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or .cse9 (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse42 (select .cse41 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse41 .cse3) c_~min1~0) (not (< 0 ~M~0)) (<= (+ .cse42 1) c_~min2~0) (< (select .cse41 c_~A~0.offset) c_~min2~0) (< 1 ~M~0) (not (< .cse42 c_~min3~0))))))) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse43 (select .cse46 .cse3)) (.cse45 (select .cse46 c_~A~0.offset))) (or (not (< .cse43 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse44 (select .cse46 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= (+ .cse44 1) .cse45) (< 1 ~M~0) (not (< .cse44 c_~min3~0))))) (not (< .cse45 c_~min2~0)) (= .cse43 .cse45))))) (or .cse12 (forall ((v_ArrVal_1128 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse48 (select .cse47 c_~A~0.offset))) (or (< (select .cse47 .cse3) c_~min1~0) (not (< 0 ~M~0)) (not (< .cse48 c_~min2~0)) (< (select .cse47 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (<= .cse48 c_~min3~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse51 (select .cse50 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse49 (select .cse50 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= (+ .cse49 1) c_~min2~0) (< 1 ~M~0) (not (< .cse49 c_~min3~0))))) (not (< .cse51 c_~min1~0)) (= c_~min2~0 .cse51) (< (select .cse50 c_~A~0.offset) c_~min2~0)))))))) is different from false [2022-12-05 21:53:24,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~min3~0 1))) (let ((.cse30 (<= c_~min2~0 c_~min3~0)) (.cse5 (= c_~min1~0 c_~min3~0)) (.cse14 (<= .cse8 c_~min2~0)) (.cse39 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (= c_~min2~0 .cse0) (= c_~min3~0 .cse0) (< (select .cse1 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse1 c_~A~0.offset) c_~min2~0) (not (< .cse0 c_~min1~0)))))))) (or (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< .cse3 c_~min2~0)) (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min1~0 .cse3) (< (select .cse4 .cse2) c_~min1~0) (< 1 ~M~0))))) .cse5) (forall ((v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (not (< .cse6 c_~min2~0)) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min1~0 .cse6) (< (select .cse7 .cse2) c_~min1~0) (<= .cse8 .cse6))))) (< 1 ~M~0))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse9 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse9) (<= .cse10 .cse9) (not (< 0 ~M~0)) (< 1 ~M~0) (not (< .cse9 c_~min3~0))))) (not (< .cse10 c_~min2~0)) (< (select .cse11 .cse2) c_~min1~0))))) (or .cse5 (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< .cse12 c_~min2~0)) (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (<= .cse12 c_~min3~0) (< (select .cse13 .cse2) c_~min1~0) (< 1 ~M~0)))))) (or .cse14 (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse2))) (or (= c_~min2~0 .cse15) (not (< 0 ~M~0)) (< (select .cse16 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse16 c_~A~0.offset) c_~min2~0) (not (< .cse15 c_~min1~0)) (< 1 ~M~0)))))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse2))) (or (forall ((~M~0 Int)) (let ((.cse17 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= c_~min2~0 .cse17) (not (< 0 ~M~0)) (= .cse17 .cse18) (< 1 ~M~0) (not (< .cse17 c_~min3~0))))) (< (select .cse19 c_~A~0.offset) c_~min2~0) (not (< .cse18 c_~min1~0)))))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse2))) (or (= c_~min2~0 .cse20) (forall ((~M~0 Int)) (let ((.cse21 (select .cse22 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (<= (+ .cse21 1) c_~min2~0) (< 1 ~M~0) (not (< .cse21 c_~min3~0))))) (< (select .cse22 c_~A~0.offset) c_~min2~0) (not (< .cse20 c_~min1~0)))))) (forall ((v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse23 (select .cse25 c_~A~0.offset)) (.cse24 (select .cse25 .cse2))) (or (not (< .cse23 c_~min2~0)) (= c_~min3~0 .cse24) (< (select .cse25 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse24 c_~min1~0)) (= .cse23 .cse24))))))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse2))) (or (forall ((~M~0 Int)) (let ((.cse26 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse26 1) .cse27) (not (< 0 ~M~0)) (< 1 ~M~0) (not (< .cse26 c_~min3~0))))) (not (< .cse27 c_~min2~0)) (not (< .cse29 c_~min1~0)) (= .cse27 .cse29))))) (or .cse30 (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse2))) (or (not (< 0 ~M~0)) (= c_~min3~0 .cse31) (< (select .cse32 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse32 c_~A~0.offset) c_~min2~0) (not (< .cse31 c_~min1~0)) (< 1 ~M~0)))))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse33) (<= c_~min2~0 .cse33) (not (< 0 ~M~0)) (< 1 ~M~0) (not (< .cse33 c_~min3~0))))) (< (select .cse34 c_~A~0.offset) c_~min2~0) (< (select .cse34 .cse2) c_~min1~0)))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse36 (select .cse37 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse35 (select .cse37 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ .cse35 1) .cse36) (not (< 0 ~M~0)) (< 1 ~M~0) (not (< .cse35 c_~min3~0))))) (not (< .cse36 c_~min2~0)) (= c_~min1~0 .cse36) (< (select .cse37 .cse2) c_~min1~0))))) (or (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (or (not (< 0 ~M~0)) (< (select .cse38 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse38 c_~A~0.offset) c_~min2~0) (< (select .cse38 .cse2) c_~min1~0) (< 1 ~M~0)))) (and .cse39 .cse30) (and .cse5 .cse14)) (forall ((v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse41 (select .cse42 .cse2)) (.cse40 (select .cse42 c_~A~0.offset))) (or (not (< .cse40 c_~min2~0)) (= c_~min3~0 .cse41) (< (select .cse42 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse41 c_~min1~0)) (<= .cse40 c_~min3~0))))) (< 1 ~M~0))) (forall ((v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse43 (select .cse44 c_~A~0.offset)) (.cse45 (select .cse44 .cse2))) (or (not (< .cse43 c_~min2~0)) (< (select .cse44 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse45 c_~min1~0)) (<= .cse8 .cse43) (= .cse43 .cse45))))) (< 1 ~M~0))) (or .cse39 (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int)) (~M~0 Int)) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse47 (select .cse46 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< (select .cse46 c_~A~0.offset) c_~min2~0) (<= (+ .cse47 1) c_~min2~0) (< (select .cse46 .cse2) c_~min1~0) (< 1 ~M~0) (not (< .cse47 c_~min3~0))))))) (forall ((v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1127 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1128) c_~A~0.base))) (let ((.cse48 (select .cse51 c_~A~0.offset)) (.cse49 (select .cse51 .cse2))) (or (not (< .cse48 c_~min2~0)) (not (< .cse49 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse50 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse48 .cse50) (not (< 0 ~M~0)) (= .cse50 .cse49) (< 1 ~M~0) (not (< .cse50 c_~min3~0)))))))))))) is different from false [2022-12-05 21:53:32,648 WARN L233 SmtUtils]: Spent 7.90s on a formula simplification that was a NOOP. DAG size: 899 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-05 21:53:32,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:32,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 9088 treesize of output 10609 [2022-12-05 21:53:33,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:33,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8080 treesize of output 8087 [2022-12-05 21:53:34,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:34,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8050 treesize of output 8072 [2022-12-05 21:53:35,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:35,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8035 treesize of output 8016 [2022-12-05 21:53:36,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:36,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7979 treesize of output 7988 [2022-12-05 21:53:37,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:37,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7951 treesize of output 7950 [2022-12-05 21:53:38,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:38,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7913 treesize of output 7916 [2022-12-05 21:53:39,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:39,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7879 treesize of output 7828 [2022-12-05 21:53:41,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:41,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7791 treesize of output 7797 [2022-12-05 21:53:41,980 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 21:53:42,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:42,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7760 treesize of output 7721 [2022-12-05 21:53:43,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:43,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7684 treesize of output 7700 [2022-12-05 21:53:44,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:44,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7663 treesize of output 7658 [2022-12-05 21:53:45,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:45,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7621 treesize of output 7600 [2022-12-05 21:53:46,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:46,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7563 treesize of output 7528 [2022-12-05 21:53:47,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:47,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7491 treesize of output 7384 [2022-12-05 21:53:49,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:49,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7347 treesize of output 7316 [2022-12-05 21:53:50,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:50,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7279 treesize of output 7272 [2022-12-05 21:53:51,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7235 treesize of output 7250 [2022-12-05 21:53:52,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:52,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7213 treesize of output 7196 [2022-12-05 21:53:53,844 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2022-12-05 21:53:54,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:54,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7159 treesize of output 7169 [2022-12-05 21:53:55,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:55,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7132 treesize of output 7125 [2022-12-05 21:53:56,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:56,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7088 treesize of output 7101 [2022-12-05 21:53:57,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:57,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7064 treesize of output 7053 [2022-12-05 21:53:58,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:53:58,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7016 treesize of output 7001 [2022-12-05 21:54:00,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:00,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6964 treesize of output 6897 [2022-12-05 21:54:01,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:01,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6860 treesize of output 6833 [2022-12-05 21:54:03,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:03,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6796 treesize of output 6705 [2022-12-05 21:54:04,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:04,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6668 treesize of output 6589 [2022-12-05 21:54:05,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:05,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6552 treesize of output 6531 [2022-12-05 21:54:07,389 INFO L208 tifierPushTermWalker]: Run 30 iterations without descend maybe there is a nontermination bug. [2022-12-05 21:54:07,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:07,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6494 treesize of output 6481 [2022-12-05 21:54:09,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:09,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6444 treesize of output 6456 [2022-12-05 21:54:10,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:10,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6419 treesize of output 6340 [2022-12-05 21:54:12,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:12,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6303 treesize of output 6306 [2022-12-05 21:54:13,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6269 treesize of output 6238 [2022-12-05 21:54:15,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:15,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6201 treesize of output 6176 [2022-12-05 21:54:16,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:16,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6139 treesize of output 6142 [2022-12-05 21:54:18,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:54:18,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6105 treesize of output 6074 Received shutdown request... [2022-12-05 22:03:59,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 22:03:59,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 22:03:59,242 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-05 22:03:59,244 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 22:03:59,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-05 22:03:59,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-05 22:03:59,448 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 59ms.. [2022-12-05 22:03:59,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 22:03:59,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 22:03:59,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 22:03:59,450 INFO L458 BasicCegarLoop]: Path program histogram: [18, 4, 1, 1, 1] [2022-12-05 22:03:59,452 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:03:59,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:03:59,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:03:59 BasicIcfg [2022-12-05 22:03:59,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:03:59,454 INFO L158 Benchmark]: Toolchain (without parser) took 847436.58ms. Allocated memory was 174.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 150.3MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-05 22:03:59,454 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:03:59,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.04ms. Allocated memory is still 174.1MB. Free memory was 150.0MB in the beginning and 138.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 22:03:59,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.27ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:03:59,454 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:03:59,454 INFO L158 Benchmark]: RCFGBuilder took 412.46ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 114.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:03:59,455 INFO L158 Benchmark]: TraceAbstraction took 846787.56ms. Allocated memory was 174.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 113.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-05 22:03:59,455 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.14ms. Allocated memory is still 127.9MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.04ms. Allocated memory is still 174.1MB. Free memory was 150.0MB in the beginning and 138.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.27ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 412.46ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 114.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 846787.56ms. Allocated memory was 174.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 113.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 127 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1062, Positive conditional cache size: 0, Positive unconditional cache size: 1062, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 59ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 59ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 59ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 59ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 846.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 128.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5589 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5589 mSDsluCounter, 1301 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17986 IncrementalHoareTripleChecker+Invalid, 18506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 454 mSolverCounterUnsat, 172 mSDtfsCounter, 17986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1763 GetRequests, 840 SyntacticMatches, 35 SemanticMatches, 888 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10204 ImplicationChecksByTransitivity, 25.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46548occurred in iteration=23, InterpolantAutomatonStates: 576, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 65.5s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1594 ConstructedInterpolants, 23 QuantifiedInterpolants, 23219 SizeOfPredicates, 223 NumberOfNonLiveVariables, 4924 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 70 InterpolantComputations, 3 PerfectInterpolantSequences, 159/321 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown