/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 18:08:38,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 18:08:38,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 18:08:38,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 18:08:38,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 18:08:38,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 18:08:38,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 18:08:38,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 18:08:38,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 18:08:38,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 18:08:38,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 18:08:38,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 18:08:38,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 18:08:38,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 18:08:38,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 18:08:38,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 18:08:38,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 18:08:38,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 18:08:38,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 18:08:38,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 18:08:38,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 18:08:38,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 18:08:38,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 18:08:38,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 18:08:38,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 18:08:38,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 18:08:38,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 18:08:38,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 18:08:38,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 18:08:38,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 18:08:38,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 18:08:38,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 18:08:38,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 18:08:38,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 18:08:38,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 18:08:38,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 18:08:38,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 18:08:38,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 18:08:38,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 18:08:38,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 18:08:38,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 18:08:38,625 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-NoLbe.epf [2022-12-06 18:08:38,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 18:08:38,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 18:08:38,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 18:08:38,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 18:08:38,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 18:08:38,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 18:08:38,653 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 18:08:38,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 18:08:38,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 18:08:38,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 18:08:38,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 18:08:38,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:08:38,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 18:08:38,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 18:08:38,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 18:08:38,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 18:08:38,656 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 18:08:38,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 18:08:38,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 18:08:38,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 18:08:38,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 18:08:38,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 18:08:38,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 18:08:38,969 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 18:08:38,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-06 18:08:39,996 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 18:08:40,177 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 18:08:40,177 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-06 18:08:40,184 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782898c7/78607393b13c4e759355a6dda72df2bc/FLAGd3e2ffea3 [2022-12-06 18:08:40,198 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782898c7/78607393b13c4e759355a6dda72df2bc [2022-12-06 18:08:40,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 18:08:40,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 18:08:40,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 18:08:40,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 18:08:40,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 18:08:40,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325deeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40, skipping insertion in model container [2022-12-06 18:08:40,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 18:08:40,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 18:08:40,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,384 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-queue-add-2-nl.wvr.c[2870,2883] [2022-12-06 18:08:40,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:08:40,404 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 18:08:40,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:08:40,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:08:40,435 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-queue-add-2-nl.wvr.c[2870,2883] [2022-12-06 18:08:40,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:08:40,454 INFO L208 MainTranslator]: Completed translation [2022-12-06 18:08:40,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40 WrapperNode [2022-12-06 18:08:40,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 18:08:40,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 18:08:40,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 18:08:40,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 18:08:40,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,498 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-12-06 18:08:40,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 18:08:40,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 18:08:40,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 18:08:40,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 18:08:40,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,518 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 18:08:40,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 18:08:40,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 18:08:40,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 18:08:40,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (1/1) ... [2022-12-06 18:08:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:08:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:08:40,555 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-06 18:08:40,557 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-06 18:08:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 18:08:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 18:08:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 18:08:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 18:08:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 18:08:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 18:08:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 18:08:40,594 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 18:08:40,665 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 18:08:40,667 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 18:08:40,983 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 18:08:41,070 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 18:08:41,070 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 18:08:41,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:08:41 BoogieIcfgContainer [2022-12-06 18:08:41,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 18:08:41,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 18:08:41,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 18:08:41,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 18:08:41,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:08:40" (1/3) ... [2022-12-06 18:08:41,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b7b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:08:41, skipping insertion in model container [2022-12-06 18:08:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:08:40" (2/3) ... [2022-12-06 18:08:41,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b7b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:08:41, skipping insertion in model container [2022-12-06 18:08:41,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:08:41" (3/3) ... [2022-12-06 18:08:41,082 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-12-06 18:08:41,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 18:08:41,096 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 18:08:41,096 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 18:08:41,143 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 18:08:41,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 133 transitions, 282 flow [2022-12-06 18:08:41,219 INFO L130 PetriNetUnfolder]: 11/131 cut-off events. [2022-12-06 18:08:41,219 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:08:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 131 events. 11/131 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 96. Up to 3 conditions per place. [2022-12-06 18:08:41,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 133 transitions, 282 flow [2022-12-06 18:08:41,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2022-12-06 18:08:41,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 18:08:41,246 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;@513fcaf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 18:08:41,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 18:08:41,270 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-06 18:08:41,270 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:08:41,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:41,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:41,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1186405957, now seen corresponding path program 1 times [2022-12-06 18:08:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:41,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866433233] [2022-12-06 18:08:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:41,484 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-06 18:08:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866433233] [2022-12-06 18:08:41,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866433233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:41,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:41,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 18:08:41,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707591586] [2022-12-06 18:08:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:41,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 18:08:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 18:08:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 18:08:41,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133 [2022-12-06 18:08:41,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 258 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-06 18:08:41,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133 [2022-12-06 18:08:41,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:41,583 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-06 18:08:41,583 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 18:08:41,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 149 events. 12/149 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 5 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 94. Up to 22 conditions per place. [2022-12-06 18:08:41,589 INFO L137 encePairwiseOnDemand]: 125/133 looper letters, 7 selfloop transitions, 0 changer transitions 4/115 dead transitions. [2022-12-06 18:08:41,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 256 flow [2022-12-06 18:08:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 18:08:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 18:08:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2022-12-06 18:08:41,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9360902255639098 [2022-12-06 18:08:41,601 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-12-06 18:08:41,602 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 256 flow [2022-12-06 18:08:41,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-06 18:08:41,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:41,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 18:08:41,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1969845943, now seen corresponding path program 1 times [2022-12-06 18:08:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349247327] [2022-12-06 18:08:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:42,028 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-06 18:08:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349247327] [2022-12-06 18:08:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349247327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:42,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:08:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910965640] [2022-12-06 18:08:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:42,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:08:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:42,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:08:42,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:08:42,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 133 [2022-12-06 18:08:42,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 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-06 18:08:42,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:42,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 133 [2022-12-06 18:08:42,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:42,173 INFO L130 PetriNetUnfolder]: 12/184 cut-off events. [2022-12-06 18:08:42,176 INFO L131 PetriNetUnfolder]: For 48/60 co-relation queries the response was YES. [2022-12-06 18:08:42,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 184 events. 12/184 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 303 event pairs, 5 based on Foata normal form. 5/173 useless extension candidates. Maximal degree in co-relation 148. Up to 31 conditions per place. [2022-12-06 18:08:42,180 INFO L137 encePairwiseOnDemand]: 123/133 looper letters, 19 selfloop transitions, 6 changer transitions 7/122 dead transitions. [2022-12-06 18:08:42,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 336 flow [2022-12-06 18:08:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 18:08:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 18:08:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2022-12-06 18:08:42,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.807733619763695 [2022-12-06 18:08:42,189 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2022-12-06 18:08:42,190 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 336 flow [2022-12-06 18:08:42,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 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-06 18:08:42,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:42,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 18:08:42,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -725699008, now seen corresponding path program 1 times [2022-12-06 18:08:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500197443] [2022-12-06 18:08:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500197443] [2022-12-06 18:08:42,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500197443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:42,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:42,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 18:08:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967698749] [2022-12-06 18:08:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:42,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 18:08:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 18:08:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 18:08:42,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2022-12-06 18:08:42,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-06 18:08:42,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:42,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2022-12-06 18:08:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:42,485 INFO L130 PetriNetUnfolder]: 12/185 cut-off events. [2022-12-06 18:08:42,485 INFO L131 PetriNetUnfolder]: For 80/92 co-relation queries the response was YES. [2022-12-06 18:08:42,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 185 events. 12/185 cut-off events. For 80/92 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 290 event pairs, 1 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 166. Up to 30 conditions per place. [2022-12-06 18:08:42,488 INFO L137 encePairwiseOnDemand]: 129/133 looper letters, 11 selfloop transitions, 3 changer transitions 7/125 dead transitions. [2022-12-06 18:08:42,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 389 flow [2022-12-06 18:08:42,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 18:08:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 18:08:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-12-06 18:08:42,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8872180451127819 [2022-12-06 18:08:42,491 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places. [2022-12-06 18:08:42,491 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 389 flow [2022-12-06 18:08:42,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-06 18:08:42,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:42,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:42,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 18:08:42,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -334040692, now seen corresponding path program 2 times [2022-12-06 18:08:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103183042] [2022-12-06 18:08:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:43,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103183042] [2022-12-06 18:08:43,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103183042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:43,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454168076] [2022-12-06 18:08:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:43,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:43,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:43,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 389 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:43,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:43,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:43,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:43,788 INFO L130 PetriNetUnfolder]: 128/475 cut-off events. [2022-12-06 18:08:43,789 INFO L131 PetriNetUnfolder]: For 566/614 co-relation queries the response was YES. [2022-12-06 18:08:43,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 475 events. 128/475 cut-off events. For 566/614 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1965 event pairs, 18 based on Foata normal form. 2/437 useless extension candidates. Maximal degree in co-relation 688. Up to 174 conditions per place. [2022-12-06 18:08:43,791 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 21 changer transitions 16/175 dead transitions. [2022-12-06 18:08:43,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 834 flow [2022-12-06 18:08:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1637 transitions. [2022-12-06 18:08:43,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6154135338345864 [2022-12-06 18:08:43,799 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2022-12-06 18:08:43,799 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 175 transitions, 834 flow [2022-12-06 18:08:43,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:43,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:43,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:43,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 18:08:43,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 467457834, now seen corresponding path program 3 times [2022-12-06 18:08:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:43,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674837368] [2022-12-06 18:08:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:44,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674837368] [2022-12-06 18:08:44,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674837368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:44,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:44,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689383789] [2022-12-06 18:08:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:44,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:44,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 175 transitions, 834 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:44,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:44,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:44,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:44,769 INFO L130 PetriNetUnfolder]: 139/527 cut-off events. [2022-12-06 18:08:44,769 INFO L131 PetriNetUnfolder]: For 923/1102 co-relation queries the response was YES. [2022-12-06 18:08:44,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 527 events. 139/527 cut-off events. For 923/1102 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2363 event pairs, 16 based on Foata normal form. 6/488 useless extension candidates. Maximal degree in co-relation 995. Up to 205 conditions per place. [2022-12-06 18:08:44,772 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 79 selfloop transitions, 34 changer transitions 23/208 dead transitions. [2022-12-06 18:08:44,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 208 transitions, 1320 flow [2022-12-06 18:08:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 18:08:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 18:08:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1563 transitions. [2022-12-06 18:08:44,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6185199841709537 [2022-12-06 18:08:44,776 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2022-12-06 18:08:44,777 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 208 transitions, 1320 flow [2022-12-06 18:08:44,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:44,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:44,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:44,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 18:08:44,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash -360819448, now seen corresponding path program 4 times [2022-12-06 18:08:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329654809] [2022-12-06 18:08:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:45,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329654809] [2022-12-06 18:08:45,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329654809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:45,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:45,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007275948] [2022-12-06 18:08:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:45,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:45,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:45,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 208 transitions, 1320 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:45,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:45,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:45,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:45,660 INFO L130 PetriNetUnfolder]: 141/538 cut-off events. [2022-12-06 18:08:45,661 INFO L131 PetriNetUnfolder]: For 1303/1694 co-relation queries the response was YES. [2022-12-06 18:08:45,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1996 conditions, 538 events. 141/538 cut-off events. For 1303/1694 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2450 event pairs, 16 based on Foata normal form. 24/516 useless extension candidates. Maximal degree in co-relation 1327. Up to 226 conditions per place. [2022-12-06 18:08:45,665 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 87 selfloop transitions, 29 changer transitions 31/219 dead transitions. [2022-12-06 18:08:45,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 219 transitions, 1702 flow [2022-12-06 18:08:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 18:08:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 18:08:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1556 transitions. [2022-12-06 18:08:45,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6157499010684606 [2022-12-06 18:08:45,671 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 64 predicate places. [2022-12-06 18:08:45,671 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 219 transitions, 1702 flow [2022-12-06 18:08:45,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:45,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:45,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:45,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 18:08:45,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1169754876, now seen corresponding path program 5 times [2022-12-06 18:08:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:45,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526623691] [2022-12-06 18:08:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:46,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526623691] [2022-12-06 18:08:46,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526623691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:46,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:46,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796794986] [2022-12-06 18:08:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:46,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:46,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:46,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:46,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 219 transitions, 1702 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:46,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:46,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:46,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:46,547 INFO L130 PetriNetUnfolder]: 144/567 cut-off events. [2022-12-06 18:08:46,547 INFO L131 PetriNetUnfolder]: For 1777/2077 co-relation queries the response was YES. [2022-12-06 18:08:46,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2462 conditions, 567 events. 144/567 cut-off events. For 1777/2077 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2706 event pairs, 17 based on Foata normal form. 24/543 useless extension candidates. Maximal degree in co-relation 1526. Up to 239 conditions per place. [2022-12-06 18:08:46,552 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 89 selfloop transitions, 30 changer transitions 38/229 dead transitions. [2022-12-06 18:08:46,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 229 transitions, 2127 flow [2022-12-06 18:08:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1641 transitions. [2022-12-06 18:08:46,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6169172932330828 [2022-12-06 18:08:46,556 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 83 predicate places. [2022-12-06 18:08:46,556 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 229 transitions, 2127 flow [2022-12-06 18:08:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:46,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:46,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:46,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 18:08:46,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337872, now seen corresponding path program 6 times [2022-12-06 18:08:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533240124] [2022-12-06 18:08:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:47,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533240124] [2022-12-06 18:08:47,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533240124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:47,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:47,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119089105] [2022-12-06 18:08:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:47,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:47,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:47,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:47,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 229 transitions, 2127 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:47,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:47,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:47,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:47,506 INFO L130 PetriNetUnfolder]: 155/637 cut-off events. [2022-12-06 18:08:47,506 INFO L131 PetriNetUnfolder]: For 2759/3103 co-relation queries the response was YES. [2022-12-06 18:08:47,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 637 events. 155/637 cut-off events. For 2759/3103 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3406 event pairs, 15 based on Foata normal form. 33/622 useless extension candidates. Maximal degree in co-relation 1980. Up to 277 conditions per place. [2022-12-06 18:08:47,511 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 97 selfloop transitions, 37 changer transitions 45/251 dead transitions. [2022-12-06 18:08:47,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 251 transitions, 2784 flow [2022-12-06 18:08:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 18:08:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 18:08:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1721 transitions. [2022-12-06 18:08:47,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161833154314358 [2022-12-06 18:08:47,518 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 103 predicate places. [2022-12-06 18:08:47,518 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 251 transitions, 2784 flow [2022-12-06 18:08:47,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:47,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:47,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:47,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 18:08:47,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:47,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 316381968, now seen corresponding path program 7 times [2022-12-06 18:08:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:47,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807530276] [2022-12-06 18:08:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807530276] [2022-12-06 18:08:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807530276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:47,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:47,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302782048] [2022-12-06 18:08:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:47,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:47,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 251 transitions, 2784 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:47,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:47,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:47,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:48,309 INFO L130 PetriNetUnfolder]: 160/662 cut-off events. [2022-12-06 18:08:48,309 INFO L131 PetriNetUnfolder]: For 3635/3985 co-relation queries the response was YES. [2022-12-06 18:08:48,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3758 conditions, 662 events. 160/662 cut-off events. For 3635/3985 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3659 event pairs, 12 based on Foata normal form. 19/632 useless extension candidates. Maximal degree in co-relation 2637. Up to 296 conditions per place. [2022-12-06 18:08:48,314 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 107 selfloop transitions, 34 changer transitions 52/265 dead transitions. [2022-12-06 18:08:48,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 265 transitions, 3378 flow [2022-12-06 18:08:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 18:08:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 18:08:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1561 transitions. [2022-12-06 18:08:48,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6177285318559557 [2022-12-06 18:08:48,320 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 121 predicate places. [2022-12-06 18:08:48,320 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 265 transitions, 3378 flow [2022-12-06 18:08:48,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:48,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:48,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 18:08:48,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash -213639802, now seen corresponding path program 8 times [2022-12-06 18:08:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:48,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835190023] [2022-12-06 18:08:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:48,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835190023] [2022-12-06 18:08:48,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835190023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:48,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:48,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85791801] [2022-12-06 18:08:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:48,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:48,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:48,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 265 transitions, 3378 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:48,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:48,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:48,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:49,219 INFO L130 PetriNetUnfolder]: 165/699 cut-off events. [2022-12-06 18:08:49,219 INFO L131 PetriNetUnfolder]: For 4879/5436 co-relation queries the response was YES. [2022-12-06 18:08:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 699 events. 165/699 cut-off events. For 4879/5436 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4022 event pairs, 13 based on Foata normal form. 21/669 useless extension candidates. Maximal degree in co-relation 3109. Up to 315 conditions per place. [2022-12-06 18:08:49,225 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 113 selfloop transitions, 36 changer transitions 59/280 dead transitions. [2022-12-06 18:08:49,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 280 transitions, 4062 flow [2022-12-06 18:08:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1639 transitions. [2022-12-06 18:08:49,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161654135338346 [2022-12-06 18:08:49,228 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 140 predicate places. [2022-12-06 18:08:49,228 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 280 transitions, 4062 flow [2022-12-06 18:08:49,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:49,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:49,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 18:08:49,229 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 560488426, now seen corresponding path program 9 times [2022-12-06 18:08:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348677776] [2022-12-06 18:08:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348677776] [2022-12-06 18:08:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348677776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:49,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853266595] [2022-12-06 18:08:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:49,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:49,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 280 transitions, 4062 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:49,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:49,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:49,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:50,021 INFO L130 PetriNetUnfolder]: 167/731 cut-off events. [2022-12-06 18:08:50,021 INFO L131 PetriNetUnfolder]: For 6165/6938 co-relation queries the response was YES. [2022-12-06 18:08:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4988 conditions, 731 events. 167/731 cut-off events. For 6165/6938 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4320 event pairs, 17 based on Foata normal form. 19/696 useless extension candidates. Maximal degree in co-relation 3194. Up to 323 conditions per place. [2022-12-06 18:08:50,026 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 120 selfloop transitions, 32 changer transitions 67/291 dead transitions. [2022-12-06 18:08:50,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 291 transitions, 4698 flow [2022-12-06 18:08:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 18:08:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 18:08:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1558 transitions. [2022-12-06 18:08:50,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6165413533834586 [2022-12-06 18:08:50,029 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 158 predicate places. [2022-12-06 18:08:50,029 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 291 transitions, 4698 flow [2022-12-06 18:08:50,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:50,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:50,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 18:08:50,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1093333078, now seen corresponding path program 10 times [2022-12-06 18:08:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:50,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545782961] [2022-12-06 18:08:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:50,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545782961] [2022-12-06 18:08:50,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545782961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:50,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:50,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853181055] [2022-12-06 18:08:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:50,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:50,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:50,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 291 transitions, 4698 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:50,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:50,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:50,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:50,849 INFO L130 PetriNetUnfolder]: 170/748 cut-off events. [2022-12-06 18:08:50,849 INFO L131 PetriNetUnfolder]: For 7651/8570 co-relation queries the response was YES. [2022-12-06 18:08:50,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 748 events. 170/748 cut-off events. For 7651/8570 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4491 event pairs, 15 based on Foata normal form. 19/712 useless extension candidates. Maximal degree in co-relation 3604. Up to 336 conditions per place. [2022-12-06 18:08:50,856 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 122 selfloop transitions, 33 changer transitions 74/301 dead transitions. [2022-12-06 18:08:50,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 301 transitions, 5367 flow [2022-12-06 18:08:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1643 transitions. [2022-12-06 18:08:50,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6176691729323308 [2022-12-06 18:08:50,859 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 177 predicate places. [2022-12-06 18:08:50,859 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 301 transitions, 5367 flow [2022-12-06 18:08:50,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:50,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:50,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 18:08:50,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -566104442, now seen corresponding path program 11 times [2022-12-06 18:08:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808178679] [2022-12-06 18:08:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:51,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808178679] [2022-12-06 18:08:51,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808178679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:51,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:51,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554126714] [2022-12-06 18:08:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:51,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:51,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 301 transitions, 5367 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:51,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:51,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:51,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:51,715 INFO L130 PetriNetUnfolder]: 173/766 cut-off events. [2022-12-06 18:08:51,715 INFO L131 PetriNetUnfolder]: For 9391/10366 co-relation queries the response was YES. [2022-12-06 18:08:51,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6275 conditions, 766 events. 173/766 cut-off events. For 9391/10366 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4731 event pairs, 12 based on Foata normal form. 13/723 useless extension candidates. Maximal degree in co-relation 4188. Up to 349 conditions per place. [2022-12-06 18:08:51,721 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 122 selfloop transitions, 39 changer transitions 81/314 dead transitions. [2022-12-06 18:08:51,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 6169 flow [2022-12-06 18:08:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1641 transitions. [2022-12-06 18:08:51,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6169172932330828 [2022-12-06 18:08:51,726 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 196 predicate places. [2022-12-06 18:08:51,726 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 314 transitions, 6169 flow [2022-12-06 18:08:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:51,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:51,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:51,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 18:08:51,727 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1892374102, now seen corresponding path program 12 times [2022-12-06 18:08:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120765527] [2022-12-06 18:08:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:52,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120765527] [2022-12-06 18:08:52,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120765527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:52,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:52,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438033658] [2022-12-06 18:08:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:52,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:52,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:52,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 314 transitions, 6169 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:52,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:52,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:52,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:52,682 INFO L130 PetriNetUnfolder]: 175/789 cut-off events. [2022-12-06 18:08:52,682 INFO L131 PetriNetUnfolder]: For 11312/12547 co-relation queries the response was YES. [2022-12-06 18:08:52,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6933 conditions, 789 events. 175/789 cut-off events. For 11312/12547 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4933 event pairs, 14 based on Foata normal form. 11/742 useless extension candidates. Maximal degree in co-relation 4548. Up to 357 conditions per place. [2022-12-06 18:08:52,687 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 129 selfloop transitions, 35 changer transitions 89/325 dead transitions. [2022-12-06 18:08:52,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 325 transitions, 6939 flow [2022-12-06 18:08:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 18:08:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 18:08:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1560 transitions. [2022-12-06 18:08:52,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6173328056984567 [2022-12-06 18:08:52,690 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 214 predicate places. [2022-12-06 18:08:52,690 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 325 transitions, 6939 flow [2022-12-06 18:08:52,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:52,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:52,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 18:08:52,692 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -942371762, now seen corresponding path program 13 times [2022-12-06 18:08:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:52,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380179507] [2022-12-06 18:08:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:53,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380179507] [2022-12-06 18:08:53,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380179507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:53,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:08:53,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 18:08:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306148058] [2022-12-06 18:08:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:53,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 18:08:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 18:08:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-12-06 18:08:53,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-06 18:08:53,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 325 transitions, 6939 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:53,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:53,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-06 18:08:53,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:53,581 INFO L130 PetriNetUnfolder]: 178/813 cut-off events. [2022-12-06 18:08:53,581 INFO L131 PetriNetUnfolder]: For 13590/15180 co-relation queries the response was YES. [2022-12-06 18:08:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7651 conditions, 813 events. 178/813 cut-off events. For 13590/15180 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5153 event pairs, 16 based on Foata normal form. 11/764 useless extension candidates. Maximal degree in co-relation 4926. Up to 370 conditions per place. [2022-12-06 18:08:53,588 INFO L137 encePairwiseOnDemand]: 112/133 looper letters, 131 selfloop transitions, 36 changer transitions 96/335 dead transitions. [2022-12-06 18:08:53,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 335 transitions, 7736 flow [2022-12-06 18:08:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 18:08:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 18:08:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1645 transitions. [2022-12-06 18:08:53,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 18:08:53,592 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 233 predicate places. [2022-12-06 18:08:53,592 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 335 transitions, 7736 flow [2022-12-06 18:08:53,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 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-06 18:08:53,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:53,593 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:08:53,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 18:08:53,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash 987023786, now seen corresponding path program 1 times [2022-12-06 18:08:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:53,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713882382] [2022-12-06 18:08:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713882382] [2022-12-06 18:08:53,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713882382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:08:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788918604] [2022-12-06 18:08:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:08:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:08:53,788 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-06 18:08:53,819 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-06 18:08:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:53,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 18:08:53,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:08:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:08:54,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 18:08:54,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788918604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:08:54,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 18:08:54,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2022-12-06 18:08:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531965780] [2022-12-06 18:08:54,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:08:54,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 18:08:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:54,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 18:08:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 18:08:54,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2022-12-06 18:08:54,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 335 transitions, 7736 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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-06 18:08:54,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:54,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2022-12-06 18:08:54,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:54,184 INFO L130 PetriNetUnfolder]: 248/1050 cut-off events. [2022-12-06 18:08:54,184 INFO L131 PetriNetUnfolder]: For 19532/21059 co-relation queries the response was YES. [2022-12-06 18:08:54,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10352 conditions, 1050 events. 248/1050 cut-off events. For 19532/21059 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7140 event pairs, 68 based on Foata normal form. 46/1004 useless extension candidates. Maximal degree in co-relation 7682. Up to 559 conditions per place. [2022-12-06 18:08:54,202 INFO L137 encePairwiseOnDemand]: 129/133 looper letters, 18 selfloop transitions, 11 changer transitions 183/333 dead transitions. [2022-12-06 18:08:54,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 333 transitions, 7911 flow [2022-12-06 18:08:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 18:08:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 18:08:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2022-12-06 18:08:54,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2022-12-06 18:08:54,204 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 236 predicate places. [2022-12-06 18:08:54,204 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 333 transitions, 7911 flow [2022-12-06 18:08:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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-06 18:08:54,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:54,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:54,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 18:08:54,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 18:08:54,410 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash 119082883, now seen corresponding path program 1 times [2022-12-06 18:08:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:54,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488455639] [2022-12-06 18:08:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:54,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488455639] [2022-12-06 18:08:54,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488455639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:08:54,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153808030] [2022-12-06 18:08:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:08:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:08:54,517 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-06 18:08:54,520 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-06 18:08:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:54,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 18:08:54,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:08:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:54,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:08:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:54,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153808030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:08:54,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:08:54,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-06 18:08:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442418353] [2022-12-06 18:08:54,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:08:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 18:08:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 18:08:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-06 18:08:54,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2022-12-06 18:08:54,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 333 transitions, 7911 flow. Second operand has 19 states, 19 states have (on average 102.63157894736842) internal successors, (1950), 19 states have internal predecessors, (1950), 0 states have call successors, (0), 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-06 18:08:54,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:54,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2022-12-06 18:08:54,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:08:55,338 INFO L130 PetriNetUnfolder]: 349/1624 cut-off events. [2022-12-06 18:08:55,338 INFO L131 PetriNetUnfolder]: For 31640/33651 co-relation queries the response was YES. [2022-12-06 18:08:55,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16066 conditions, 1624 events. 349/1624 cut-off events. For 31640/33651 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12995 event pairs, 89 based on Foata normal form. 37/1525 useless extension candidates. Maximal degree in co-relation 7361. Up to 830 conditions per place. [2022-12-06 18:08:55,348 INFO L137 encePairwiseOnDemand]: 121/133 looper letters, 40 selfloop transitions, 11 changer transitions 259/414 dead transitions. [2022-12-06 18:08:55,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 414 transitions, 11049 flow [2022-12-06 18:08:55,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 18:08:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 18:08:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1347 transitions. [2022-12-06 18:08:55,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7790630422209369 [2022-12-06 18:08:55,355 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 248 predicate places. [2022-12-06 18:08:55,355 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 414 transitions, 11049 flow [2022-12-06 18:08:55,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 102.63157894736842) internal successors, (1950), 19 states have internal predecessors, (1950), 0 states have call successors, (0), 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-06 18:08:55,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:08:55,356 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:55,364 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-06 18:08:55,562 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,SelfDestructingSolverStorable16 [2022-12-06 18:08:55,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:08:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:08:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 317882060, now seen corresponding path program 2 times [2022-12-06 18:08:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:08:55,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189421577] [2022-12-06 18:08:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:08:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:08:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:08:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:56,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:08:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189421577] [2022-12-06 18:08:56,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189421577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:08:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045568745] [2022-12-06 18:08:56,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:08:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:08:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:08:56,451 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-06 18:08:56,453 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-06 18:08:56,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:08:56,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:08:56,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 18:08:56,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:08:57,299 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-06 18:08:57,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-12-06 18:08:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:57,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:08:57,521 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 18:08:57,522 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 25 treesize of output 16 [2022-12-06 18:08:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:08:58,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045568745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:08:58,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:08:58,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 18] total 55 [2022-12-06 18:08:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951155923] [2022-12-06 18:08:58,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:08:58,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-06 18:08:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:08:58,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-06 18:08:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=2503, Unknown=0, NotChecked=0, Total=2970 [2022-12-06 18:08:58,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 133 [2022-12-06 18:08:58,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 414 transitions, 11049 flow. Second operand has 55 states, 55 states have (on average 55.25454545454546) internal successors, (3039), 55 states have internal predecessors, (3039), 0 states have call successors, (0), 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-06 18:08:58,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:08:58,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 133 [2022-12-06 18:08:58,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:09:05,760 INFO L130 PetriNetUnfolder]: 3367/8679 cut-off events. [2022-12-06 18:09:05,761 INFO L131 PetriNetUnfolder]: For 132206/134399 co-relation queries the response was YES. [2022-12-06 18:09:05,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87926 conditions, 8679 events. 3367/8679 cut-off events. For 132206/134399 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 82057 event pairs, 656 based on Foata normal form. 157/8023 useless extension candidates. Maximal degree in co-relation 40668. Up to 4810 conditions per place. [2022-12-06 18:09:05,831 INFO L137 encePairwiseOnDemand]: 96/133 looper letters, 360 selfloop transitions, 135 changer transitions 638/1181 dead transitions. [2022-12-06 18:09:05,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1181 transitions, 33752 flow [2022-12-06 18:09:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-06 18:09:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2022-12-06 18:09:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 5691 transitions. [2022-12-06 18:09:05,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43662728249194416 [2022-12-06 18:09:05,837 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 345 predicate places. [2022-12-06 18:09:05,838 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 1181 transitions, 33752 flow [2022-12-06 18:09:05,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 55.25454545454546) internal successors, (3039), 55 states have internal predecessors, (3039), 0 states have call successors, (0), 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-06 18:09:05,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:09:05,839 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:09:05,847 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-06 18:09:06,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 18:09:06,045 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:09:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:09:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash 794601948, now seen corresponding path program 3 times [2022-12-06 18:09:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:09:06,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934830206] [2022-12-06 18:09:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:09:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:09:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:09:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:09:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:09:07,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934830206] [2022-12-06 18:09:07,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934830206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:09:07,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974731775] [2022-12-06 18:09:07,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 18:09:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:09:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:09:07,109 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-06 18:09:07,123 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-06 18:09:07,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 18:09:07,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:09:07,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 18:09:07,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:09:07,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:09:07,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:09:07,685 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 23 treesize of output 7 [2022-12-06 18:09:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-06 18:09:07,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:09:07,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:09:07,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2022-12-06 18:09:07,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 18:09:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-06 18:09:08,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974731775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:09:08,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:09:08,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 46 [2022-12-06 18:09:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793894534] [2022-12-06 18:09:08,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:09:08,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-06 18:09:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:09:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-06 18:09:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1926, Unknown=0, NotChecked=0, Total=2070 [2022-12-06 18:09:08,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2022-12-06 18:09:08,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1181 transitions, 33752 flow. Second operand has 46 states, 46 states have (on average 74.67391304347827) internal successors, (3435), 46 states have internal predecessors, (3435), 0 states have call successors, (0), 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-06 18:09:08,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:09:08,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2022-12-06 18:09:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:09:14,926 INFO L130 PetriNetUnfolder]: 3556/9139 cut-off events. [2022-12-06 18:09:14,926 INFO L131 PetriNetUnfolder]: For 158603/161103 co-relation queries the response was YES. [2022-12-06 18:09:14,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98481 conditions, 9139 events. 3556/9139 cut-off events. For 158603/161103 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 86117 event pairs, 677 based on Foata normal form. 121/8605 useless extension candidates. Maximal degree in co-relation 38647. Up to 5206 conditions per place. [2022-12-06 18:09:14,998 INFO L137 encePairwiseOnDemand]: 109/133 looper letters, 333 selfloop transitions, 94 changer transitions 685/1287 dead transitions. [2022-12-06 18:09:14,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1287 transitions, 37799 flow [2022-12-06 18:09:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 18:09:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 18:09:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3875 transitions. [2022-12-06 18:09:15,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5712811440365619 [2022-12-06 18:09:15,002 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 393 predicate places. [2022-12-06 18:09:15,002 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1287 transitions, 37799 flow [2022-12-06 18:09:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 74.67391304347827) internal successors, (3435), 46 states have internal predecessors, (3435), 0 states have call successors, (0), 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-06 18:09:15,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:09:15,003 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:09:15,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 18:09:15,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:09:15,226 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:09:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:09:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1403007100, now seen corresponding path program 1 times [2022-12-06 18:09:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:09:15,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019744492] [2022-12-06 18:09:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:09:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:09:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:09:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:09:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:09:17,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019744492] [2022-12-06 18:09:17,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019744492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:09:17,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691689542] [2022-12-06 18:09:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:09:17,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:09:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:09:17,212 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-06 18:09:17,214 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-06 18:09:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:09:17,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-06 18:09:17,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:09:19,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:09:19,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:09:19,611 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-06 18:09:19,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-12-06 18:09:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:09:20,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:09:23,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:09:23,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 61 treesize of output 57 [2022-12-06 18:09:23,555 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 40 treesize of output 34 [2022-12-06 18:09:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:09:25,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691689542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:09:25,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:09:25,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42, 40] total 110 [2022-12-06 18:09:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070838925] [2022-12-06 18:09:25,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:09:25,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-12-06 18:09:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:09:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-12-06 18:09:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=11103, Unknown=8, NotChecked=0, Total=11990 [2022-12-06 18:09:25,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 133 [2022-12-06 18:09:25,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1287 transitions, 37799 flow. Second operand has 110 states, 110 states have (on average 41.054545454545455) internal successors, (4516), 110 states have internal predecessors, (4516), 0 states have call successors, (0), 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-06 18:09:25,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:09:25,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 133 [2022-12-06 18:09:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:09:46,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (+ (* c_~q_front~0 4) c_~q~0.offset)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0)))) (and (or .cse0 .cse1 (and .cse2 (= (+ c_~s~0 (select (select |c_#memory_int| c_~q~0.base) .cse3)) c_~N~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or (and .cse2 (forall ((v_ArrVal_310 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) c_~q~0.base) .cse3)))) .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse1))) is different from false [2022-12-06 18:09:56,871 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 46 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:10:12,538 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 53 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:10:23,890 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 50 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:10:32,859 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:10:36,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:39,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:42,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:44,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:46,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:48,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:50,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:10:52,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:11,338 WARN L233 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:11:19,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:21,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:23,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:25,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:27,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:28,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:30,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:32,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:36,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:38,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:11:50,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:11:57,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:11:58,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:00,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:02,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:04,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:07,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:09,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:33,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:37,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:12:48,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:12:50,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:12:52,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:12:54,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:12:56,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:12:58,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:13:00,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:13:03,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:13:07,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:09,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:12,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:14,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:16,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:19,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:22,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:24,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:26,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:29,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:13:40,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:13:42,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:14:02,395 WARN L233 SmtUtils]: Spent 14.32s on a formula simplification. DAG size of input: 78 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:14:34,180 WARN L233 SmtUtils]: Spent 28.65s on a formula simplification. DAG size of input: 77 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:14:40,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:14:42,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:14:44,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:15:04,992 WARN L233 SmtUtils]: Spent 16.36s on a formula simplification. DAG size of input: 67 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:15:30,224 WARN L233 SmtUtils]: Spent 20.64s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:15:44,785 WARN L233 SmtUtils]: Spent 14.25s on a formula simplification. DAG size of input: 59 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:15:48,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:15:52,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:15:54,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:15:56,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:15:58,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:15:59,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:01,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:03,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:05,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:07,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:09,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:11,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:14,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:16,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:18,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:19,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:28,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:30,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:32,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:34,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:37,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:40,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:42,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:44,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:46,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:48,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:51,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:53,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:55,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:16:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:00,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:06,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:17:08,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:17:10,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:17:16,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:18,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:20,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:22,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:23,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:25,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:28,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:32,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:17:55,337 WARN L233 SmtUtils]: Spent 14.36s on a formula simplification. DAG size of input: 86 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:18:00,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:18:01,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:18:06,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 18:18:18,294 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:18:21,181 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* c_~q_front~0 4) c_~q~0.offset)) (.cse9 (mod c_~x~0 4294967296))) (let ((.cse0 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9)) (.cse8 (forall ((v_ArrVal_310 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) c_~q~0.base) .cse10))))) (let ((.cse3 (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) .cse10)) (.cse1 (and .cse0 .cse8)) (.cse2 (not (<= 0 c_~q_back~0))) (.cse6 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse4 (not (< c_~q_back~0 c_~n~0)))) (and .cse0 (= c_~s~0 c_~N~0) (or .cse1 .cse2 .cse3 .cse4) (or .cse2 (and .cse0 (= c_~N~0 .cse5)) .cse3 .cse4) (or .cse2 .cse6 .cse4 (and (let ((.cse7 (* 4294967295 c_~x~0))) (< (* (div (+ .cse7 c_~y~0 4294967295) 4294967296) 4294967296) (+ .cse7 c_~y~0 1))) .cse8)) (or .cse2 .cse4 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse0)) (or .cse2 .cse4 (and .cse0 (= (+ c_~s~0 .cse5) c_~N~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse1 .cse2 .cse6 .cse4) (= .cse9 (mod c_~y~0 4294967296)))))) is different from false [2022-12-06 18:18:40,551 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 51 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:18:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:18:47,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:18:50,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:18:57,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:19:13,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:19:15,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 18:19:16,441 INFO L130 PetriNetUnfolder]: 11641/25358 cut-off events. [2022-12-06 18:19:16,441 INFO L131 PetriNetUnfolder]: For 456936/462126 co-relation queries the response was YES. [2022-12-06 18:19:16,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291126 conditions, 25358 events. 11641/25358 cut-off events. For 456936/462126 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 257756 event pairs, 375 based on Foata normal form. 219/23875 useless extension candidates. Maximal degree in co-relation 175067. Up to 15357 conditions per place. [2022-12-06 18:19:16,657 INFO L137 encePairwiseOnDemand]: 77/133 looper letters, 2150 selfloop transitions, 1481 changer transitions 1683/5346 dead transitions. [2022-12-06 18:19:16,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 5346 transitions, 148806 flow [2022-12-06 18:19:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 410 states. [2022-12-06 18:19:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2022-12-06 18:19:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 18105 transitions. [2022-12-06 18:19:16,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33201907207042 [2022-12-06 18:19:16,675 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 802 predicate places. [2022-12-06 18:19:16,675 INFO L495 AbstractCegarLoop]: Abstraction has has 921 places, 5346 transitions, 148806 flow [2022-12-06 18:19:16,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 41.054545454545455) internal successors, (4516), 110 states have internal predecessors, (4516), 0 states have call successors, (0), 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-06 18:19:16,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:19:16,676 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:19:16,699 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-06 18:19:16,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:19:16,884 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:19:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:19:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1598908442, now seen corresponding path program 2 times [2022-12-06 18:19:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:19:16,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660718130] [2022-12-06 18:19:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:19:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:19:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:19:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:19:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:19:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660718130] [2022-12-06 18:19:19,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660718130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:19:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145443265] [2022-12-06 18:19:19,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:19:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:19:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:19:19,296 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-06 18:19:19,298 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-06 18:19:19,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:19:19,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:19:19,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-06 18:19:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:19:20,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:19:20,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:19:21,532 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-06 18:19:21,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:19:21,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:19:22,448 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 23 treesize of output 7 [2022-12-06 18:19:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:19:23,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:19:25,005 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q_back~0)) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (not (< c_~q_back~0 c_~n~0)) (< c_~n~0 (+ c_~q_front~0 2)) (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_344 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse0) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) (forall ((v_ArrVal_344 (Array Int Int))) (< |c_thread1Thread1of1ForFork0_~i~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse0))) (let ((.cse1 (* 4294967295 c_~x~0))) (< (* (div (+ .cse1 c_~y~0 4294967295) 4294967296) 4294967296) (+ .cse1 c_~y~0 1)))))) is different from false [2022-12-06 18:19:30,134 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (let ((.cse1 (+ (* 4 c_~q_back~0) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| Int) (v_ArrVal_341 Int) (v_ArrVal_343 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_341)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse2 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|))) (let ((.cse3 (* 4294967295 c_~x~0))) (< (* (div (+ .cse3 c_~y~0 4294967295) 4294967296) 4294967296) (+ .cse3 c_~y~0 1)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_341)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (< 0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse2 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| Int) (v_ArrVal_341 Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_341)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (not (= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (< (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 2) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse2 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_24|)))))) (< c_~n~0 (+ c_~q_front~0 2))) is different from false [2022-12-06 18:19:30,220 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-06 18:19:30,220 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 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-06 18:19:30,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:19:30,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 54 treesize of output 50 [2022-12-06 18:19:30,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-12-06 18:19:30,326 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-06 18:19:30,327 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 2 case distinctions, treesize of input 71 treesize of output 66 [2022-12-06 18:19:30,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:19:30,360 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 121 treesize of output 133 [2022-12-06 18:19:30,370 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 60 treesize of output 48 [2022-12-06 18:19:30,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:19:30,383 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 51 treesize of output 51 [2022-12-06 18:19:30,540 INFO L321 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2022-12-06 18:19:30,541 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 2 case distinctions, treesize of input 71 treesize of output 1 [2022-12-06 18:19:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-06 18:19:32,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145443265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:19:32,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:19:32,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43, 43] total 116 [2022-12-06 18:19:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855375892] [2022-12-06 18:19:32,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:19:32,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-12-06 18:19:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:19:32,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-12-06 18:19:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=12009, Unknown=65, NotChecked=450, Total=13340 [2022-12-06 18:19:32,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 133 [2022-12-06 18:19:32,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 5346 transitions, 148806 flow. Second operand has 116 states, 116 states have (on average 36.03448275862069) internal successors, (4180), 116 states have internal predecessors, (4180), 0 states have call successors, (0), 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-06 18:19:32,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:19:32,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 133 [2022-12-06 18:19:32,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:19:42,696 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 250 DAG size of output: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:20:00,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 c_~q_back~0))) (let ((.cse9 (* c_~q_front~0 4)) (.cse20 (+ c_~q~0.offset .cse10)) (.cse2 (<= (mod |c_ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741823))) (let ((.cse1 (not .cse2)) (.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse12 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse3 (+ c_~q_front~0 c_~n~0)) (.cse18 (not (= (select (select |c_#memory_int| c_~q~0.base) .cse20) 1))) (.cse6 (not (< c_~q_back~0 c_~n~0))) (.cse19 (+ .cse9 c_~q~0.offset)) (.cse11 (let ((.cse23 (* 4294967295 c_~x~0))) (< (* (div (+ .cse23 c_~y~0 4294967295) 4294967296) 4294967296) (+ .cse23 c_~y~0 1)))) (.cse7 (< c_~n~0 (+ c_~q_front~0 2))) (.cse5 (not (<= 0 c_~q_back~0))) (.cse17 (<= c_~n~0 c_~q_back~0))) (and .cse0 (or (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))) (= c_~y~0 0) (<= .cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~q_back~0)) (= c_~q_front~0 c_~q_back~0) (<= .cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~q_back~0)) .cse2 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ c_~q_front~0 c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (+ |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~q_back~0 1)) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2) (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~q_front~0 c_~q_back~0) (or .cse5 .cse6 .cse7 (let ((.cse8 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse8 (and (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= .cse9 .cse10))) (or .cse8 .cse11)))) (<= .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse5 .cse6 .cse7 (let ((.cse14 (+ .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse10))) (and (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (forall ((v_ArrVal_344 (Array Int Int))) (< (select (select (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse14) 2)) (not (= (select (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse15) 1))))) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (forall ((v_ArrVal_344 (Array Int Int))) (< 0 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse14))) (not (= (select (select .cse16 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse15) 1))))) (or .cse11 (forall ((v_ArrVal_343 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse15) 1))))))) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or .cse5 .cse17 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or .cse0 .cse5 .cse17) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~x~0 0) (<= .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse5 .cse18 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse6 (and (forall ((v_ArrVal_344 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse19))) .cse11) .cse7) (<= .cse3 (+ 2 c_~q_back~0)) (or (and (or (forall ((v_ArrVal_343 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) c_~q~0.base) .cse20)))) .cse11) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (forall ((v_ArrVal_344 (Array Int Int))) (< (select (select (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse19) 2)) (not (= 1 (select (select .cse21 c_~q~0.base) .cse20)))))) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343))) (or (forall ((v_ArrVal_344 (Array Int Int))) (< 0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse19))) (not (= 1 (select (select .cse22 c_~q~0.base) .cse20))))))) .cse5 .cse6 .cse7) (or .cse5 .cse18 .cse6 (and (forall ((v_ArrVal_344 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse19) 2)) (forall ((v_ArrVal_344 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) c_~q~0.base) .cse19))) .cse11) .cse7) (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 2) (or .cse5 .cse17 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-12-06 18:20:34,452 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 250 DAG size of output: 243 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:21:02,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:08,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:11,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:13,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:15,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:17,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:18,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:23,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:21:34,200 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 248 DAG size of output: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:21:40,946 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 244 DAG size of output: 233 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:22:27,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 18:22:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-12-06 18:22:32,039 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 18:22:32,045 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-06 18:22:32,059 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-06 18:22:32,070 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 18:22:32,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:22:32,240 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 236 known predicates. [2022-12-06 18:22:32,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 18:22:32,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 18:22:32,242 INFO L458 BasicCegarLoop]: Path program histogram: [13, 3, 2, 1, 1, 1] [2022-12-06 18:22:32,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 18:22:32,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 18:22:32,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:22:32 BasicIcfg [2022-12-06 18:22:32,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 18:22:32,247 INFO L158 Benchmark]: Toolchain (without parser) took 832045.77ms. Allocated memory was 192.9MB in the beginning and 924.8MB in the end (delta: 731.9MB). Free memory was 169.1MB in the beginning and 365.8MB in the end (delta: -196.8MB). Peak memory consumption was 535.7MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,247 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 170.5MB in the beginning and 170.5MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 18:22:32,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 156.4MB in the end (delta: 12.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.01ms. Allocated memory is still 192.9MB. Free memory was 156.4MB in the beginning and 154.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,248 INFO L158 Benchmark]: Boogie Preprocessor took 24.27ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 152.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,248 INFO L158 Benchmark]: RCFGBuilder took 547.41ms. Allocated memory is still 192.9MB. Free memory was 152.8MB in the beginning and 128.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,248 INFO L158 Benchmark]: TraceAbstraction took 831173.42ms. Allocated memory was 192.9MB in the beginning and 924.8MB in the end (delta: 731.9MB). Free memory was 128.2MB in the beginning and 365.8MB in the end (delta: -237.7MB). Peak memory consumption was 493.7MB. Max. memory is 8.0GB. [2022-12-06 18:22:32,249 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.11ms. Allocated memory is still 192.9MB. Free memory was 170.5MB in the beginning and 170.5MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 156.4MB in the end (delta: 12.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.01ms. Allocated memory is still 192.9MB. Free memory was 156.4MB in the beginning and 154.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.27ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 152.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 547.41ms. Allocated memory is still 192.9MB. Free memory was 152.8MB in the beginning and 128.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 831173.42ms. Allocated memory was 192.9MB in the beginning and 924.8MB in the end (delta: 731.9MB). Free memory was 128.2MB in the beginning and 365.8MB in the end (delta: -237.7MB). Peak memory consumption was 493.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 236 known predicates. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 236 known predicates. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 236 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 147 locations, 3 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: 831.1s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 790.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 372 mSolverCounterUnknown, 13964 SdHoareTripleChecker+Valid, 279.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13964 mSDsluCounter, 13494 SdHoareTripleChecker+Invalid, 274.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 841 IncrementalHoareTripleChecker+Unchecked, 12746 mSDsCounter, 2829 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33205 IncrementalHoareTripleChecker+Invalid, 37247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2829 mSolverCounterUnsat, 748 mSDtfsCounter, 33205 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2407 GetRequests, 1114 SyntacticMatches, 20 SemanticMatches, 1272 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 124646 ImplicationChecksByTransitivity, 511.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148806occurred in iteration=20, InterpolantAutomatonStates: 824, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 2936 NumberOfCodeBlocks, 2929 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3492 ConstructedInterpolants, 64 QuantifiedInterpolants, 48168 SizeOfPredicates, 141 NumberOfNonLiveVariables, 1688 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 41/181 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