/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 23:01:10,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 23:01:10,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 23:01:11,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 23:01:11,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 23:01:11,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 23:01:11,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 23:01:11,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 23:01:11,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 23:01:11,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 23:01:11,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 23:01:11,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 23:01:11,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 23:01:11,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 23:01:11,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 23:01:11,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 23:01:11,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 23:01:11,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 23:01:11,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 23:01:11,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 23:01:11,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 23:01:11,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 23:01:11,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 23:01:11,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 23:01:11,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 23:01:11,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 23:01:11,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 23:01:11,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 23:01:11,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 23:01:11,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 23:01:11,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 23:01:11,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 23:01:11,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 23:01:11,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 23:01:11,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 23:01:11,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 23:01:11,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 23:01:11,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 23:01:11,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 23:01:11,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 23:01:11,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 23:01:11,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 23:01:11,057 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 23:01:11,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 23:01:11,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 23:01:11,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 23:01:11,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 23:01:11,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 23:01:11,059 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 23:01:11,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 23:01:11,059 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 23:01:11,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 23:01:11,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 23:01:11,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 23:01:11,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 23:01:11,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 23:01:11,062 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 23:01:11,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 23:01:11,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 23:01:11,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 23:01:11,274 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 23:01:11,274 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 23:01:11,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-27 23:01:12,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 23:01:12,374 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 23:01:12,374 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-27 23:01:12,379 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680f86f56/32510f91d2564f70ba1ea14082c42f41/FLAGafe49e690 [2023-01-27 23:01:12,391 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680f86f56/32510f91d2564f70ba1ea14082c42f41 [2023-01-27 23:01:12,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 23:01:12,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 23:01:12,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 23:01:12,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 23:01:12,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 23:01:12,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746a5545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12, skipping insertion in model container [2023-01-27 23:01:12,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 23:01:12,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 23:01:12,538 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-27 23:01:12,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 23:01:12,551 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 23:01:12,566 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-27 23:01:12,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 23:01:12,573 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 23:01:12,573 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 23:01:12,577 INFO L208 MainTranslator]: Completed translation [2023-01-27 23:01:12,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12 WrapperNode [2023-01-27 23:01:12,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 23:01:12,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 23:01:12,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 23:01:12,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 23:01:12,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,603 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-01-27 23:01:12,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 23:01:12,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 23:01:12,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 23:01:12,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 23:01:12,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,620 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 23:01:12,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 23:01:12,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 23:01:12,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 23:01:12,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (1/1) ... [2023-01-27 23:01:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 23:01:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:01:12,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 23:01:12,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 23:01:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 23:01:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 23:01:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 23:01:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 23:01:12,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 23:01:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 23:01:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 23:01:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 23:01:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 23:01:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 23:01:12,699 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 23:01:12,785 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 23:01:12,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 23:01:13,042 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 23:01:13,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 23:01:13,139 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 23:01:13,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:01:13 BoogieIcfgContainer [2023-01-27 23:01:13,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 23:01:13,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 23:01:13,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 23:01:13,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 23:01:13,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:01:12" (1/3) ... [2023-01-27 23:01:13,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acf4074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:01:13, skipping insertion in model container [2023-01-27 23:01:13,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:01:12" (2/3) ... [2023-01-27 23:01:13,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acf4074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:01:13, skipping insertion in model container [2023-01-27 23:01:13,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:01:13" (3/3) ... [2023-01-27 23:01:13,146 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-01-27 23:01:13,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 23:01:13,158 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 23:01:13,158 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 23:01:13,212 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 23:01:13,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-01-27 23:01:13,285 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-01-27 23:01:13,286 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 23:01:13,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-01-27 23:01:13,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-01-27 23:01:13,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-01-27 23:01:13,295 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 23:01:13,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-27 23:01:13,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-27 23:01:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-01-27 23:01:13,327 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-01-27 23:01:13,327 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 23:01:13,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 13/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-01-27 23:01:13,328 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-01-27 23:01:17,680 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-01-27 23:01:17,681 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-01-27 23:01:17,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 23:01:17,698 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;@29bc2ea4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 23:01:17,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 23:01:17,701 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-01-27 23:01:17,702 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 23:01:17,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:17,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:17,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:17,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-01-27 23:01:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:17,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650026400] [2023-01-27 23:01:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650026400] [2023-01-27 23:01:18,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650026400] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 23:01:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765858536] [2023-01-27 23:01:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:01:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:01:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:01:18,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-01-27 23:01:18,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-01-27 23:01:18,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,126 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-01-27 23:01:18,126 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-27 23:01:18,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-01-27 23:01:18,128 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-01-27 23:01:18,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-01-27 23:01:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:01:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:01:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-01-27 23:01:18,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540918163672655 [2023-01-27 23:01:18,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-01-27 23:01:18,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-01-27 23:01:18,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-01-27 23:01:18,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,152 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 455 transitions. [2023-01-27 23:01:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-01-27 23:01:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 23:01:18,155 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-01-27 23:01:18,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-01-27 23:01:18,159 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-01-27 23:01:18,159 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-01-27 23:01:18,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:18,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:18,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 23:01:18,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:18,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-01-27 23:01:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634015995] [2023-01-27 23:01:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634015995] [2023-01-27 23:01:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634015995] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:01:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116340301] [2023-01-27 23:01:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 23:01:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 23:01:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 23:01:18,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-27 23:01:18,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-27 23:01:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,315 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-01-27 23:01:18,316 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-27 23:01:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 194 events. 102/194 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 9 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 114. Up to 76 conditions per place. [2023-01-27 23:01:18,317 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-01-27 23:01:18,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-01-27 23:01:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 23:01:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 23:01:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-01-27 23:01:18,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467065868263473 [2023-01-27 23:01:18,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-01-27 23:01:18,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-01-27 23:01:18,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-01-27 23:01:18,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,332 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 746 transitions. [2023-01-27 23:01:18,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-01-27 23:01:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 23:01:18,334 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-01-27 23:01:18,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-01-27 23:01:18,335 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-01-27 23:01:18,335 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-01-27 23:01:18,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:18,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 23:01:18,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:18,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-01-27 23:01:18,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:18,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171234468] [2023-01-27 23:01:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171234468] [2023-01-27 23:01:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171234468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:01:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539076694] [2023-01-27 23:01:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 23:01:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 23:01:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 23:01:18,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-27 23:01:18,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-27 23:01:18,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,528 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-01-27 23:01:18,528 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-01-27 23:01:18,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 165 events. 89/165 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 15 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 192. Up to 120 conditions per place. [2023-01-27 23:01:18,532 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-01-27 23:01:18,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-01-27 23:01:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 23:01:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 23:01:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-01-27 23:01:18,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44461077844311375 [2023-01-27 23:01:18,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-01-27 23:01:18,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-01-27 23:01:18,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-01-27 23:01:18,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,538 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 594 transitions. [2023-01-27 23:01:18,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-01-27 23:01:18,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 23:01:18,541 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-01-27 23:01:18,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-01-27 23:01:18,543 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-27 23:01:18,549 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-01-27 23:01:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:18,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 23:01:18,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:18,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-01-27 23:01:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507564429] [2023-01-27 23:01:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507564429] [2023-01-27 23:01:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507564429] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:01:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247673406] [2023-01-27 23:01:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 23:01:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 23:01:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 23:01:18,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-27 23:01:18,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-27 23:01:18,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,701 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-01-27 23:01:18,702 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-01-27 23:01:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 98/173 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 18 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 214. Up to 122 conditions per place. [2023-01-27 23:01:18,703 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-01-27 23:01:18,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-01-27 23:01:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 23:01:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 23:01:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2023-01-27 23:01:18,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43892215568862275 [2023-01-27 23:01:18,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2023-01-27 23:01:18,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2023-01-27 23:01:18,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2023-01-27 23:01:18,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,714 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,714 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 733 transitions. [2023-01-27 23:01:18,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-01-27 23:01:18,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-27 23:01:18,717 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-01-27 23:01:18,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-01-27 23:01:18,718 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-27 23:01:18,718 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-01-27 23:01:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:18,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 23:01:18,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:18,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-01-27 23:01:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971510953] [2023-01-27 23:01:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971510953] [2023-01-27 23:01:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971510953] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:01:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017549757] [2023-01-27 23:01:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 23:01:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 23:01:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 23:01:18,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-27 23:01:18,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-27 23:01:18,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,861 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-01-27 23:01:18,861 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-01-27 23:01:18,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 188 events. 102/188 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 61 based on Foata normal form. 8/192 useless extension candidates. Maximal degree in co-relation 308. Up to 174 conditions per place. [2023-01-27 23:01:18,862 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-01-27 23:01:18,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-01-27 23:01:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 23:01:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 23:01:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-01-27 23:01:18,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026946107784431 [2023-01-27 23:01:18,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-01-27 23:01:18,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-01-27 23:01:18,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-01-27 23:01:18,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,868 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 538 transitions. [2023-01-27 23:01:18,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-01-27 23:01:18,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 23:01:18,870 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-01-27 23:01:18,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-01-27 23:01:18,872 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-01-27 23:01:18,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-01-27 23:01:18,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:18,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:18,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 23:01:18,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:18,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-01-27 23:01:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058610022] [2023-01-27 23:01:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 23:01:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058610022] [2023-01-27 23:01:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058610022] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:18,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:18,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 23:01:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015447315] [2023-01-27 23:01:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:18,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 23:01:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 23:01:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 23:01:18,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-27 23:01:18,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:18,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-27 23:01:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:18,993 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-01-27 23:01:18,993 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-01-27 23:01:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 183 events. 99/183 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 59 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 616. Up to 175 conditions per place. [2023-01-27 23:01:18,994 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-01-27 23:01:18,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-01-27 23:01:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 23:01:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 23:01:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-01-27 23:01:18,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40119760479041916 [2023-01-27 23:01:18,996 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-01-27 23:01:18,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-01-27 23:01:18,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:18,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-01-27 23:01:18,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,999 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:18,999 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 536 transitions. [2023-01-27 23:01:18,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-01-27 23:01:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-27 23:01:19,001 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-01-27 23:01:19,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-01-27 23:01:19,002 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-01-27 23:01:19,002 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-01-27 23:01:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:19,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:19,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:19,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 23:01:19,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:19,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-01-27 23:01:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317821945] [2023-01-27 23:01:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:01:19,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:19,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317821945] [2023-01-27 23:01:19,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317821945] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:01:19,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:01:19,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 23:01:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89238950] [2023-01-27 23:01:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:01:19,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:01:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:01:19,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:01:19,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-27 23:01:19,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 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) [2023-01-27 23:01:19,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:19,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-27 23:01:19,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:19,122 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-01-27 23:01:19,122 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-01-27 23:01:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 140 events. 77/140 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 19 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 487. Up to 123 conditions per place. [2023-01-27 23:01:19,123 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-01-27 23:01:19,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-01-27 23:01:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:01:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:01:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-01-27 23:01:19,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-01-27 23:01:19,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-01-27 23:01:19,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-01-27 23:01:19,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:01:19,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-01-27 23:01:19,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:19,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:19,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:19,127 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-01-27 23:01:19,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-01-27 23:01:19,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-01-27 23:01:19,128 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-01-27 23:01:19,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-01-27 23:01:19,128 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-01-27 23:01:19,128 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-01-27 23:01:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 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) [2023-01-27 23:01:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:01:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:01:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 23:01:19,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:01:19,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:01:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-01-27 23:01:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:01:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392740336] [2023-01-27 23:01:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:01:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:01:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:01:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:01:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:01:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392740336] [2023-01-27 23:01:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392740336] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:01:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124625951] [2023-01-27 23:01:20,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 23:01:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:01:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:01:20,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:01:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 23:01:20,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 23:01:20,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:01:20,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-01-27 23:01:20,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:01:20,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:01:20,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:01:20,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:01:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:01:20,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:01:21,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:21,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-01-27 23:01:21,177 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-27 23:01:21,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1112 treesize of output 1048 [2023-01-27 23:01:21,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:21,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 462 [2023-01-27 23:01:21,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:21,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 402 [2023-01-27 23:01:49,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:49,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 80 [2023-01-27 23:01:49,952 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-27 23:01:49,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 550 treesize of output 493 [2023-01-27 23:01:49,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:01:49,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:01:49,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:49,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 366 [2023-01-27 23:01:49,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:01:49,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:01:49,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:01:49,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 306 [2023-01-27 23:01:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:01:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124625951] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:01:50,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:01:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-01-27 23:01:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730316776] [2023-01-27 23:01:50,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:01:50,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 23:01:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:01:50,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 23:01:50,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=758, Unknown=3, NotChecked=0, Total=870 [2023-01-27 23:01:50,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-27 23:01:50,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 139 flow. Second operand has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:01:50,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:01:50,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-27 23:01:50,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:01:59,217 WARN L222 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 74 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 23:02:02,101 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-01-27 23:02:02,101 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-01-27 23:02:02,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 446 events. 244/446 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1739 event pairs, 6 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 1404. Up to 173 conditions per place. [2023-01-27 23:02:02,104 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-01-27 23:02:02,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-01-27 23:02:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 23:02:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 23:02:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-01-27 23:02:02,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-01-27 23:02:02,109 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-01-27 23:02:02,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-01-27 23:02:02,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:02:02,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-01-27 23:02:02,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.77777777777777) internal successors, (2316), 27 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:02,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:02,124 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:02,124 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-01-27 23:02:02,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-01-27 23:02:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-27 23:02:02,127 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-01-27 23:02:02,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=664, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-01-27 23:02:02,127 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-01-27 23:02:02,127 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-01-27 23:02:02,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:02,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:02:02,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:02:02,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 23:02:02,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:02:02,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:02:02,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:02:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-01-27 23:02:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:02:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102984031] [2023-01-27 23:02:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:02:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:02:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:02:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:02:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102984031] [2023-01-27 23:02:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102984031] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:02:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727542210] [2023-01-27 23:02:03,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 23:02:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:02:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:02:03,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:02:03,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 23:02:03,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 23:02:03,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:02:03,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-01-27 23:02:03,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:02:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:02:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:02:03,359 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 23:02:03,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 23:02:03,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:02:03,463 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 23:02:03,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 23:02:03,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 23:02:03,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:02:03,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:02:04,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-01-27 23:02:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:04,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:02:05,316 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-27 23:02:05,317 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 150 treesize of output 88 [2023-01-27 23:02:05,381 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-01-27 23:02:05,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 480 treesize of output 499 [2023-01-27 23:02:05,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:02:05,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 174 [2023-01-27 23:02:05,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:02:05,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 153 [2023-01-27 23:02:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727542210] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:02:07,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:02:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-27 23:02:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175536869] [2023-01-27 23:02:07,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:02:07,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-27 23:02:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:02:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-27 23:02:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1164, Unknown=5, NotChecked=0, Total=1332 [2023-01-27 23:02:07,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-27 23:02:07,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 664 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:07,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:02:07,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-27 23:02:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:02:08,805 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse10 (+ c_~i~0 1)) (.cse6 (* c_~q1_back~0 4)) (.cse8 (* c_~q2_back~0 4)) (.cse9 (* c_~q1_front~0 4)) (.cse3 (< c_~q1_back~0 0)) (.cse4 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse1 .cse2 (< 0 c_~q2_back~0) .cse3 .cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~i~0 (select (select .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) .cse8))) (< (select .cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse10))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (< c_~j~0 .cse10) (or .cse0 .cse1 .cse2 (let ((.cse15 (+ .cse9 c_~q1~0.offset)) (.cse12 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ .cse6 c_~q1~0.offset)) (.cse16 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse13 (select .cse17 c_~q1~0.base)) (.cse11 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse11 .cse12) c_~i~0)) (not (= (select .cse13 .cse14) c_~j~0)) (< (select .cse13 .cse15) c_~i~0) (< (select .cse11 .cse16) .cse10))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse18 (select .cse20 c_~q1~0.base)) (.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse18 .cse15) .cse10) (not (= (select .cse19 .cse12) c_~i~0)) (not (= (select .cse18 .cse14) c_~j~0)) (< (select .cse19 .cse16) c_~i~0))))))) (<= c_~n2~0 c_~q2_back~0) .cse3 (<= c_~n2~0 c_~q2_front~0) .cse4))) is different from false [2023-01-27 23:02:08,821 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~i~0 1))) (let ((.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (< c_~j~0 .cse12)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse13 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse7 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse1 (and .cse2 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse5 (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse17 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse16 .cse17 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (select .cse15 c_~q1~0.base))) (or (not (= (select .cse8 .cse9) c_~j~0)) (< (select .cse10 .cse11) .cse12) (not (= (select .cse10 .cse13) c_~i~0)) (< (select .cse8 .cse14) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse16 .cse17 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse18 (select .cse20 c_~q1~0.base)) (.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse18 .cse9) c_~j~0)) (< (select .cse18 .cse14) .cse12) (not (= (select .cse19 .cse13) c_~i~0)) (< (select .cse19 .cse11) c_~i~0)))))))) .cse2 (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse21 .cse13) c_~i~0)) (not (= (select .cse22 .cse9) c_~j~0)) (< (select .cse22 .cse14) c_~i~0) (< (select .cse21 .cse11) .cse12))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse24 (select .cse26 c_~q1~0.base)) (.cse25 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse24 .cse14) .cse12) (not (= (select .cse25 .cse13) c_~i~0)) (not (= (select .cse24 .cse9) c_~j~0)) (< (select .cse25 .cse11) c_~i~0)))))) .cse6 .cse4 .cse7 .cse5)))) is different from false [2023-01-27 23:02:11,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 23:02:12,108 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_~q2_front~0 4))) (let ((.cse11 (select |c_#memory_int| c_~q2~0.base)) (.cse19 (+ c_~q2~0.offset .cse41))) (let ((.cse14 (+ c_~i~0 1)) (.cse42 (* c_~q2_back~0 4)) (.cse20 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse43 (select |c_#memory_int| c_~q1~0.base)) (.cse17 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse15 (select .cse11 .cse19))) (let ((.cse0 (< .cse15 c_~i~0)) (.cse9 (not (= (select .cse43 .cse17) c_~j~0))) (.cse13 (select .cse43 .cse20)) (.cse1 (< (+ .cse15 1) c_~N~0)) (.cse12 (+ .cse42 c_~q2~0.offset)) (.cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (< c_~j~0 .cse14)) (.cse4 (<= c_~n1~0 c_~q1_back~0)) (.cse5 (< c_~q2_back~0 0)) (.cse28 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (<= c_~n2~0 c_~q2_back~0)) (.cse8 (< c_~q1_back~0 0)) (.cse2 (<= c_~n2~0 c_~q2_front~0)) (.cse3 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (and .cse0 (or (< c_~i~0 (+ c_~N~0 1)) .cse1)) (< c_~i~0 c_~N~0) .cse2 .cse3) (or (< 0 c_~q2_front~0) .cse4 .cse5 (and .cse6 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse7 .cse8 .cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or .cse9 .cse4 .cse5 .cse10 .cse8 .cse2 .cse3 (not (= c_~i~0 (select .cse11 .cse12))) (and (or (< .cse13 .cse14) .cse0) (or (< .cse15 .cse14) (< .cse13 c_~i~0)))) (or .cse9 .cse4 (and (or (< .cse15 c_~N~0) (< (+ .cse13 1) c_~N~0)) (or (< .cse13 c_~N~0) .cse1)) .cse8 .cse2 .cse3) (or .cse4 .cse5 .cse10 .cse8 .cse2 .cse3 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse21 c_~q1~0.base)) (.cse18 (select .cse21 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse17))) (< (select .cse18 .cse19) .cse14) (< (select .cse16 .cse20) c_~i~0) (not (= c_~i~0 (select .cse18 .cse12))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse23 (select .cse24 c_~q1~0.base)) (.cse22 (select .cse24 c_~q2~0.base))) (or (< (select .cse22 .cse19) c_~i~0) (< (select .cse23 .cse20) .cse14) (not (= c_~j~0 (select .cse23 .cse17))) (not (= c_~i~0 (select .cse22 .cse12))))))))) (or .cse4 .cse5 .cse10 .cse7 .cse8 .cse2 .cse3 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (select .cse29 c_~q1~0.base))) (or (not (= (select .cse25 .cse17) c_~j~0)) (< (select .cse26 .cse27) .cse14) (not (= (select .cse26 .cse28) c_~i~0)) (< (select .cse25 .cse20) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse32 .cse17) c_~j~0)) (< (select .cse32 .cse20) .cse14) (not (= (select .cse33 .cse28) c_~i~0)) (< (select .cse33 .cse27) c_~i~0)))))))) .cse6 (or .cse4 .cse5 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse36 (select .cse37 c_~q1~0.base)) (.cse35 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 .cse28) c_~i~0)) (not (= (select .cse36 .cse17) c_~j~0)) (< (select .cse36 .cse20) c_~i~0) (< (select .cse35 .cse27) .cse14))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse38 (select .cse40 c_~q1~0.base)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse38 .cse20) .cse14) (not (= (select .cse39 .cse28) c_~i~0)) (not (= (select .cse38 .cse17) c_~j~0)) (< (select .cse39 .cse27) c_~i~0)))))) .cse10 .cse8 .cse2 .cse3)))))) is different from false [2023-01-27 23:02:12,682 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~q2_back~0 4)) (.cse41 (* c_~q1_front~0 4)) (.cse17 (+ c_~i~0 1)) (.cse8 (select |c_#memory_int| c_~q2~0.base)) (.cse24 (* c_~q2_front~0 4))) (let ((.cse9 (select .cse8 .cse24)) (.cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (< c_~j~0 .cse17)) (.cse2 (<= c_~n1~0 c_~q1_back~0)) (.cse3 (< c_~q2_back~0 0)) (.cse1 (+ .cse41 c_~q1~0.offset)) (.cse28 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse27 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse6 (< c_~q1_back~0 0)) (.cse12 (<= c_~n2~0 c_~q2_front~0)) (.cse7 (< c_~q2_front~0 0)) (.cse0 (select |c_#memory_int| c_~q1~0.base))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (<= (select .cse0 .cse1) 0) (<= 0 c_~q1_front~0) (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse2 .cse3 (and .cse4 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse5 .cse6 .cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (< c_~q2_front~0 c_~n2~0) (= 0 (select .cse8 0)) (<= 1 c_~N~0) (<= 0 .cse9) (not (= c_~q1~0.base c_~q2~0.base)) (= c_~q2_front~0 0) (<= c_~i~0 c_~N~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_75 Int)) (let ((.cse10 (select (select |c_#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_75))))) (and (<= v_~q1_front~0_75 0) (<= c_~i~0 (+ .cse10 1)) (<= 0 v_~q1_front~0_75) (<= .cse10 0) (not (= ~q1~0.base c_~q2~0.base))))) (< .cse9 c_~N~0) (or .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 (let ((.cse16 (+ c_~q2~0.offset .cse24)) (.cse18 (+ .cse23 c_~q2~0.offset))) (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse13 (select .cse19 c_~q1~0.base)) (.cse15 (select .cse19 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse13 .cse14))) (< (select .cse15 .cse16) .cse17) (< (select .cse13 .cse1) c_~i~0) (not (= c_~i~0 (select .cse15 .cse18))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse21 (select .cse22 c_~q1~0.base)) (.cse20 (select .cse22 c_~q2~0.base))) (or (< (select .cse20 .cse16) c_~i~0) (< (select .cse21 .cse1) .cse17) (not (= c_~j~0 (select .cse21 .cse14))) (not (= c_~i~0 (select .cse20 .cse18)))))))))) (or .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (select .cse29 c_~q1~0.base))) (or (not (= (select .cse25 .cse14) c_~j~0)) (< (select .cse26 .cse27) .cse17) (not (= (select .cse26 .cse28) c_~i~0)) (< (select .cse25 .cse1) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse32 .cse14) c_~j~0)) (< (select .cse32 .cse1) .cse17) (not (= (select .cse33 .cse28) c_~i~0)) (< (select .cse33 .cse27) c_~i~0)))))))) .cse4 (<= 0 c_~q2_front~0) (<= c_~n2~0 1) (or .cse2 .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse36 (select .cse37 c_~q1~0.base)) (.cse35 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 .cse28) c_~i~0)) (not (= (select .cse36 .cse14) c_~j~0)) (< (select .cse36 .cse1) c_~i~0) (< (select .cse35 .cse27) .cse17))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse38 (select .cse40 c_~q1~0.base)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse38 .cse1) .cse17) (not (= (select .cse39 .cse28) c_~i~0)) (not (= (select .cse38 .cse14) c_~j~0)) (< (select .cse39 .cse27) c_~i~0)))))) .cse11 .cse6 .cse12 .cse7) (= (select .cse0 .cse41) 0) (<= c_~q1_front~0 0)))) is different from false [2023-01-27 23:02:19,808 INFO L130 PetriNetUnfolder]: 495/910 cut-off events. [2023-01-27 23:02:19,808 INFO L131 PetriNetUnfolder]: For 2780/2780 co-relation queries the response was YES. [2023-01-27 23:02:19,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 910 events. 495/910 cut-off events. For 2780/2780 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4449 event pairs, 27 based on Foata normal form. 6/910 useless extension candidates. Maximal degree in co-relation 3484. Up to 299 conditions per place. [2023-01-27 23:02:19,814 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 101 selfloop transitions, 180 changer transitions 15/296 dead transitions. [2023-01-27 23:02:19,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 296 transitions, 2693 flow [2023-01-27 23:02:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-01-27 23:02:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-01-27 23:02:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 4126 transitions. [2023-01-27 23:02:19,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24706586826347304 [2023-01-27 23:02:19,825 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 4126 transitions. [2023-01-27 23:02:19,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 4126 transitions. [2023-01-27 23:02:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:02:19,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 4126 transitions. [2023-01-27 23:02:19,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 82.52) internal successors, (4126), 50 states have internal predecessors, (4126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:19,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 334.0) internal successors, (17034), 51 states have internal predecessors, (17034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:19,846 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 334.0) internal successors, (17034), 51 states have internal predecessors, (17034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:19,846 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 50 states and 4126 transitions. [2023-01-27 23:02:19,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 296 transitions, 2693 flow [2023-01-27 23:02:19,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 296 transitions, 2395 flow, removed 132 selfloop flow, removed 4 redundant places. [2023-01-27 23:02:19,862 INFO L231 Difference]: Finished difference. Result has 129 places, 203 transitions, 2071 flow [2023-01-27 23:02:19,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=2071, PETRI_PLACES=129, PETRI_TRANSITIONS=203} [2023-01-27 23:02:19,863 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 107 predicate places. [2023-01-27 23:02:19,863 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 203 transitions, 2071 flow [2023-01-27 23:02:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:19,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:02:19,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:02:19,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 23:02:20,068 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,SelfDestructingSolverStorable8 [2023-01-27 23:02:20,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:02:20,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:02:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1135192519, now seen corresponding path program 4 times [2023-01-27 23:02:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:02:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781833858] [2023-01-27 23:02:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:02:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:02:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:02:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:02:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781833858] [2023-01-27 23:02:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781833858] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:02:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387412289] [2023-01-27 23:02:20,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 23:02:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:02:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:02:20,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:02:20,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 23:02:20,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 23:02:20,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:02:20,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-27 23:02:20,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:02:21,406 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-01-27 23:02:21,407 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 34 treesize of output 15 [2023-01-27 23:02:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:21,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:02:21,889 INFO L321 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-01-27 23:02:21,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-01-27 23:02:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387412289] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:02:25,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:02:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-01-27 23:02:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869194240] [2023-01-27 23:02:25,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:02:25,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 23:02:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:02:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 23:02:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2023-01-27 23:02:25,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 334 [2023-01-27 23:02:25,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 203 transitions, 2071 flow. Second operand has 33 states, 33 states have (on average 90.60606060606061) internal successors, (2990), 33 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:25,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:02:25,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 334 [2023-01-27 23:02:25,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:02:29,489 INFO L130 PetriNetUnfolder]: 742/1340 cut-off events. [2023-01-27 23:02:29,489 INFO L131 PetriNetUnfolder]: For 6801/6801 co-relation queries the response was YES. [2023-01-27 23:02:29,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 1340 events. 742/1340 cut-off events. For 6801/6801 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7071 event pairs, 33 based on Foata normal form. 6/1345 useless extension candidates. Maximal degree in co-relation 7556. Up to 365 conditions per place. [2023-01-27 23:02:29,499 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 141 selfloop transitions, 241 changer transitions 9/391 dead transitions. [2023-01-27 23:02:29,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 391 transitions, 4395 flow [2023-01-27 23:02:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-27 23:02:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-27 23:02:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3965 transitions. [2023-01-27 23:02:29,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2826489877388081 [2023-01-27 23:02:29,504 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3965 transitions. [2023-01-27 23:02:29,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3965 transitions. [2023-01-27 23:02:29,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:02:29,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3965 transitions. [2023-01-27 23:02:29,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 94.4047619047619) internal successors, (3965), 42 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:29,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 334.0) internal successors, (14362), 43 states have internal predecessors, (14362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:29,530 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 334.0) internal successors, (14362), 43 states have internal predecessors, (14362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:29,530 INFO L175 Difference]: Start difference. First operand has 129 places, 203 transitions, 2071 flow. Second operand 42 states and 3965 transitions. [2023-01-27 23:02:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 391 transitions, 4395 flow [2023-01-27 23:02:29,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 391 transitions, 3980 flow, removed 174 selfloop flow, removed 13 redundant places. [2023-01-27 23:02:29,568 INFO L231 Difference]: Finished difference. Result has 164 places, 287 transitions, 3274 flow [2023-01-27 23:02:29,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3274, PETRI_PLACES=164, PETRI_TRANSITIONS=287} [2023-01-27 23:02:29,569 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 142 predicate places. [2023-01-27 23:02:29,569 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 287 transitions, 3274 flow [2023-01-27 23:02:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 90.60606060606061) internal successors, (2990), 33 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:29,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:02:29,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:02:29,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 23:02:29,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:02:29,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:02:29,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:02:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2010370685, now seen corresponding path program 5 times [2023-01-27 23:02:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:02:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344063143] [2023-01-27 23:02:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:02:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:02:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:02:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:02:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:02:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344063143] [2023-01-27 23:02:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344063143] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:02:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:02:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 23:02:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573383336] [2023-01-27 23:02:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:02:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:02:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:02:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:02:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:02:29,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 334 [2023-01-27 23:02:29,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 287 transitions, 3274 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:29,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:02:29,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 334 [2023-01-27 23:02:29,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:02:30,031 INFO L130 PetriNetUnfolder]: 684/1256 cut-off events. [2023-01-27 23:02:30,031 INFO L131 PetriNetUnfolder]: For 8786/8786 co-relation queries the response was YES. [2023-01-27 23:02:30,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7894 conditions, 1256 events. 684/1256 cut-off events. For 8786/8786 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6532 event pairs, 133 based on Foata normal form. 9/1264 useless extension candidates. Maximal degree in co-relation 7680. Up to 1191 conditions per place. [2023-01-27 23:02:30,041 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 263 selfloop transitions, 15 changer transitions 0/278 dead transitions. [2023-01-27 23:02:30,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 278 transitions, 3694 flow [2023-01-27 23:02:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:02:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:02:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-01-27 23:02:30,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590818363273453 [2023-01-27 23:02:30,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-01-27 23:02:30,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-01-27 23:02:30,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:02:30,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-01-27 23:02:30,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:30,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:30,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:30,044 INFO L175 Difference]: Start difference. First operand has 164 places, 287 transitions, 3274 flow. Second operand 3 states and 460 transitions. [2023-01-27 23:02:30,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 278 transitions, 3694 flow [2023-01-27 23:02:30,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 278 transitions, 3391 flow, removed 106 selfloop flow, removed 14 redundant places. [2023-01-27 23:02:30,096 INFO L231 Difference]: Finished difference. Result has 153 places, 276 transitions, 2873 flow [2023-01-27 23:02:30,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2873, PETRI_PLACES=153, PETRI_TRANSITIONS=276} [2023-01-27 23:02:30,097 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 131 predicate places. [2023-01-27 23:02:30,097 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 276 transitions, 2873 flow [2023-01-27 23:02:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:02:30,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:02:30,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:02:30,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 23:02:30,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:02:30,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:02:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 6 times [2023-01-27 23:02:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:02:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502640692] [2023-01-27 23:02:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:02:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:02:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:02:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:02:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:02:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502640692] [2023-01-27 23:02:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502640692] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:02:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393321629] [2023-01-27 23:02:30,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 23:02:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:02:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:02:30,877 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:02:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 23:02:30,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 23:02:30,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:02:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 46 conjunts are in the unsatisfiable core [2023-01-27 23:02:30,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:02:31,323 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-01-27 23:02:31,323 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 20 [2023-01-27 23:02:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:02:31,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:02:31,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:02:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-01-27 23:03:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:03:00,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393321629] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:03:00,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:03:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-01-27 23:03:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416255630] [2023-01-27 23:03:00,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:03:00,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 23:03:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:03:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 23:03:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2023-01-27 23:03:00,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 334 [2023-01-27 23:03:00,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 276 transitions, 2873 flow. Second operand has 31 states, 31 states have (on average 90.70967741935483) internal successors, (2812), 31 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:00,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:03:00,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 334 [2023-01-27 23:03:00,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:03:12,341 WARN L222 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 23:03:13,871 INFO L130 PetriNetUnfolder]: 945/1728 cut-off events. [2023-01-27 23:03:13,871 INFO L131 PetriNetUnfolder]: For 10942/10942 co-relation queries the response was YES. [2023-01-27 23:03:13,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10322 conditions, 1728 events. 945/1728 cut-off events. For 10942/10942 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9932 event pairs, 75 based on Foata normal form. 7/1733 useless extension candidates. Maximal degree in co-relation 9317. Up to 803 conditions per place. [2023-01-27 23:03:13,882 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 186 selfloop transitions, 275 changer transitions 14/475 dead transitions. [2023-01-27 23:03:13,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 475 transitions, 5585 flow [2023-01-27 23:03:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-27 23:03:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-27 23:03:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4321 transitions. [2023-01-27 23:03:13,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28124186409789115 [2023-01-27 23:03:13,887 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4321 transitions. [2023-01-27 23:03:13,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4321 transitions. [2023-01-27 23:03:13,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:03:13,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4321 transitions. [2023-01-27 23:03:13,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 93.93478260869566) internal successors, (4321), 46 states have internal predecessors, (4321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:13,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 334.0) internal successors, (15698), 47 states have internal predecessors, (15698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:13,900 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 334.0) internal successors, (15698), 47 states have internal predecessors, (15698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:13,900 INFO L175 Difference]: Start difference. First operand has 153 places, 276 transitions, 2873 flow. Second operand 46 states and 4321 transitions. [2023-01-27 23:03:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 475 transitions, 5585 flow [2023-01-27 23:03:13,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 475 transitions, 5533 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-01-27 23:03:13,971 INFO L231 Difference]: Finished difference. Result has 208 places, 362 transitions, 4650 flow [2023-01-27 23:03:13,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4650, PETRI_PLACES=208, PETRI_TRANSITIONS=362} [2023-01-27 23:03:13,971 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 186 predicate places. [2023-01-27 23:03:13,971 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 362 transitions, 4650 flow [2023-01-27 23:03:13,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 90.70967741935483) internal successors, (2812), 31 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:13,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:03:13,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:03:13,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 23:03:14,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:03:14,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:03:14,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:03:14,178 INFO L85 PathProgramCache]: Analyzing trace with hash 226074675, now seen corresponding path program 7 times [2023-01-27 23:03:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:03:14,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394614476] [2023-01-27 23:03:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:03:14,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:03:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:03:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:03:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:03:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394614476] [2023-01-27 23:03:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394614476] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:03:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276139843] [2023-01-27 23:03:15,224 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 23:03:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:03:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:03:15,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:03:15,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 23:03:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:03:15,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-27 23:03:15,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:03:15,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:15,693 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 38 [2023-01-27 23:03:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:03:15,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:03:16,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:16,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-01-27 23:03:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:03:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276139843] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:03:27,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:03:27,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-01-27 23:03:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503844808] [2023-01-27 23:03:27,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:03:27,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 23:03:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:03:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 23:03:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2023-01-27 23:03:27,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-27 23:03:27,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 362 transitions, 4650 flow. Second operand has 31 states, 31 states have (on average 82.7741935483871) internal successors, (2566), 31 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:27,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:03:27,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-27 23:03:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:03:29,789 INFO L130 PetriNetUnfolder]: 1043/1896 cut-off events. [2023-01-27 23:03:29,789 INFO L131 PetriNetUnfolder]: For 20910/20910 co-relation queries the response was YES. [2023-01-27 23:03:29,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13471 conditions, 1896 events. 1043/1896 cut-off events. For 20910/20910 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11047 event pairs, 97 based on Foata normal form. 3/1897 useless extension candidates. Maximal degree in co-relation 13358. Up to 1056 conditions per place. [2023-01-27 23:03:29,803 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 166 selfloop transitions, 300 changer transitions 10/476 dead transitions. [2023-01-27 23:03:29,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 476 transitions, 6739 flow [2023-01-27 23:03:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-27 23:03:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-27 23:03:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2826 transitions. [2023-01-27 23:03:29,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25639629831246596 [2023-01-27 23:03:29,807 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2826 transitions. [2023-01-27 23:03:29,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2826 transitions. [2023-01-27 23:03:29,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:03:29,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2826 transitions. [2023-01-27 23:03:29,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 85.63636363636364) internal successors, (2826), 33 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:29,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 334.0) internal successors, (11356), 34 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:29,815 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 334.0) internal successors, (11356), 34 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:29,815 INFO L175 Difference]: Start difference. First operand has 208 places, 362 transitions, 4650 flow. Second operand 33 states and 2826 transitions. [2023-01-27 23:03:29,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 476 transitions, 6739 flow [2023-01-27 23:03:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 476 transitions, 6253 flow, removed 180 selfloop flow, removed 12 redundant places. [2023-01-27 23:03:29,927 INFO L231 Difference]: Finished difference. Result has 233 places, 409 transitions, 5884 flow [2023-01-27 23:03:29,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=4318, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5884, PETRI_PLACES=233, PETRI_TRANSITIONS=409} [2023-01-27 23:03:29,927 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 211 predicate places. [2023-01-27 23:03:29,927 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 409 transitions, 5884 flow [2023-01-27 23:03:29,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.7741935483871) internal successors, (2566), 31 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:29,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:03:29,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:03:29,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 23:03:30,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 23:03:30,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:03:30,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:03:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 130363839, now seen corresponding path program 8 times [2023-01-27 23:03:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:03:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266533642] [2023-01-27 23:03:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:03:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:03:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:03:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:03:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:03:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266533642] [2023-01-27 23:03:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266533642] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:03:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058863411] [2023-01-27 23:03:31,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 23:03:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:03:31,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:03:31,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:03:31,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 23:03:31,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 23:03:31,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:03:31,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 69 conjunts are in the unsatisfiable core [2023-01-27 23:03:31,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:03:31,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:03:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:03:31,167 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 23:03:31,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 23:03:31,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:03:31,289 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 23:03:31,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 23:03:31,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 23:03:31,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:03:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:03:31,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 23:03:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:03:31,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:03:32,594 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-27 23:03:32,595 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 191 treesize of output 97 [2023-01-27 23:03:32,700 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-27 23:03:32,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 532 treesize of output 584 [2023-01-27 23:03:32,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:32,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 436 treesize of output 458 [2023-01-27 23:03:32,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:32,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 368 treesize of output 312 [2023-01-27 23:03:49,186 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-27 23:03:49,186 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 189 treesize of output 95 [2023-01-27 23:03:49,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:03:49,300 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-27 23:03:49,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 312 treesize of output 380 [2023-01-27 23:03:49,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:49,321 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 210 treesize of output 182 [2023-01-27 23:03:49,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:03:49,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 230 [2023-01-27 23:03:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:03:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058863411] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:03:54,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:03:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-01-27 23:03:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489673806] [2023-01-27 23:03:54,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:03:54,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 23:03:54,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:03:54,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 23:03:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=935, Unknown=2, NotChecked=0, Total=1056 [2023-01-27 23:03:54,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-27 23:03:54,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 409 transitions, 5884 flow. Second operand has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:03:54,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:03:54,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-27 23:03:54,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:04:02,932 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 87 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 23:04:09,933 INFO L130 PetriNetUnfolder]: 1313/2415 cut-off events. [2023-01-27 23:04:09,934 INFO L131 PetriNetUnfolder]: For 37529/37529 co-relation queries the response was YES. [2023-01-27 23:04:09,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19076 conditions, 2415 events. 1313/2415 cut-off events. For 37529/37529 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 14857 event pairs, 85 based on Foata normal form. 28/2441 useless extension candidates. Maximal degree in co-relation 18911. Up to 982 conditions per place. [2023-01-27 23:04:09,950 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 262 selfloop transitions, 314 changer transitions 8/584 dead transitions. [2023-01-27 23:04:09,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 584 transitions, 9366 flow [2023-01-27 23:04:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 23:04:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 23:04:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2908 transitions. [2023-01-27 23:04:09,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24875962360992301 [2023-01-27 23:04:09,953 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2908 transitions. [2023-01-27 23:04:09,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2908 transitions. [2023-01-27 23:04:09,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:04:09,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2908 transitions. [2023-01-27 23:04:09,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 83.08571428571429) internal successors, (2908), 35 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:09,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:09,962 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:09,962 INFO L175 Difference]: Start difference. First operand has 233 places, 409 transitions, 5884 flow. Second operand 35 states and 2908 transitions. [2023-01-27 23:04:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 584 transitions, 9366 flow [2023-01-27 23:04:10,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 584 transitions, 9176 flow, removed 56 selfloop flow, removed 16 redundant places. [2023-01-27 23:04:10,100 INFO L231 Difference]: Finished difference. Result has 261 places, 493 transitions, 8236 flow [2023-01-27 23:04:10,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5423, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8236, PETRI_PLACES=261, PETRI_TRANSITIONS=493} [2023-01-27 23:04:10,101 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 239 predicate places. [2023-01-27 23:04:10,101 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 493 transitions, 8236 flow [2023-01-27 23:04:10,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:10,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:04:10,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:04:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 23:04:10,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:04:10,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:04:10,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:04:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2104011777, now seen corresponding path program 9 times [2023-01-27 23:04:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:04:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089744379] [2023-01-27 23:04:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:04:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:04:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:04:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:04:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:04:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089744379] [2023-01-27 23:04:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089744379] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:04:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667118338] [2023-01-27 23:04:11,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 23:04:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:04:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:04:11,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:04:11,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 23:04:11,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 23:04:11,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:04:11,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-27 23:04:11,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:04:11,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:04:11,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:04:11,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:04:11,589 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 29 treesize of output 29 [2023-01-27 23:04:11,937 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-01-27 23:04:11,938 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 60 treesize of output 20 [2023-01-27 23:04:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:04:12,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:04:12,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:12,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-01-27 23:04:12,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:12,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 307 [2023-01-27 23:04:12,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:12,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 195 [2023-01-27 23:04:13,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:13,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 189 [2023-01-27 23:04:26,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:26,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-01-27 23:04:26,634 INFO L321 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-01-27 23:04:26,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 339 [2023-01-27 23:04:26,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:04:26,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:26,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 140 [2023-01-27 23:04:26,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:04:26,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:26,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 150 [2023-01-27 23:04:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:04:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667118338] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:04:27,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:04:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2023-01-27 23:04:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030276936] [2023-01-27 23:04:27,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:04:27,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 23:04:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:04:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 23:04:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1142, Unknown=1, NotChecked=0, Total=1260 [2023-01-27 23:04:27,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-27 23:04:27,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 493 transitions, 8236 flow. Second operand has 36 states, 36 states have (on average 82.52777777777777) internal successors, (2971), 36 states have internal predecessors, (2971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:27,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:04:27,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-27 23:04:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:04:29,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i~0 1))) (let ((.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (< c_~q2_back~0 0)) (.cse3 (< c_~q1_back~0 0)) (.cse0 (< c_~j~0 .cse10)) (.cse4 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) .cse0 (or .cse1 .cse2 (<= c_~n2~0 c_~q2_back~0) .cse3 (<= c_~n2~0 c_~q2_front~0) .cse4 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse9 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse5 (select .cse8 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse6))) (< (select .cse5 .cse7) c_~i~0) (< (select (select .cse8 c_~q2~0.base) .cse9) .cse10))))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse12 (select .cse11 ~q1~0.base))) (or (< (select (select .cse11 c_~q2~0.base) .cse9) c_~i~0) (not (= c_~j~0 (select .cse12 .cse6))) (< (select .cse12 .cse7) .cse10)))))))) (or (< 0 c_~q2_front~0) .cse1 .cse2 (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 (and .cse0 (= c_~q1_back~0 c_~q1_front~0) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< c_~j~0 c_~i~0))) .cse4)))) is different from false [2023-01-27 23:04:29,936 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i~0 1))) (and (<= c_~i~0 c_~j~0) (< c_~j~0 .cse0) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse1 (select .cse4 ~q1~0.base))) (or (not (= c_~j~0 (select .cse1 .cse2))) (< (select .cse1 .cse3) c_~i~0) (< (select (select .cse4 c_~q2~0.base) .cse5) .cse0))))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse7 (select .cse6 ~q1~0.base))) (or (< (select (select .cse6 c_~q2~0.base) .cse5) c_~i~0) (not (= c_~j~0 (select .cse7 .cse2))) (< (select .cse7 .cse3) .cse0)))))))))) is different from false [2023-01-27 23:04:30,242 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_~i~0 1))) (let ((.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse3 (<= c_~n2~0 c_~q2_front~0)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (<= c_~n1~0 c_~q1_back~0)) (.cse7 (< c_~q2_back~0 0)) (.cse8 (< c_~q1_back~0 0)) (.cse5 (< c_~j~0 .cse13)) (.cse4 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (let ((.cse0 (select .cse1 .cse2))) (and (< .cse0 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse0 1) c_~N~0)))) (< c_~i~0 c_~N~0) .cse3 .cse4) .cse5 (or .cse6 .cse7 (<= c_~n2~0 c_~q2_back~0) .cse8 .cse3 .cse4 (not (= c_~i~0 (select .cse1 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (and (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse9 (select .cse12 ~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse10))) (< (select .cse9 .cse11) c_~i~0) (< (select (select .cse12 c_~q2~0.base) .cse2) .cse13))))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse15 (select .cse14 ~q1~0.base))) (or (< (select (select .cse14 c_~q2~0.base) .cse2) c_~i~0) (not (= c_~j~0 (select .cse15 .cse10))) (< (select .cse15 .cse11) .cse13))))))) (or .cse6 .cse8 .cse3 .cse4 (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (or (< (select (select .cse16 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (not (= c_~j~0 (select .cse17 .cse10))) (< (+ (select .cse17 .cse11) 1) c_~N~0))))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (or (forall ((~q1~0.base Int)) (let ((.cse18 (select .cse19 ~q1~0.base))) (or (not (= c_~j~0 (select .cse18 .cse10))) (< (select .cse18 .cse11) c_~N~0)))) (< (+ (select (select .cse19 c_~q2~0.base) .cse2) 1) c_~N~0)))))) (or (< 0 c_~q2_front~0) .cse6 .cse7 (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8 (and .cse5 (= c_~q1_back~0 c_~q1_front~0) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< c_~j~0 c_~i~0))) .cse4)))) is different from false [2023-01-27 23:04:37,833 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse3 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (+ c_~i~0 1)) (.cse2 (* c_~q2_front~0 4)) (.cse4 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (= (select (select |c_#memory_int| c_~q1~0.base) 0) 0) (= c_~q1~0.offset 0) (or (let ((.cse0 (select .cse1 (+ c_~q2~0.offset .cse2)))) (and (< .cse0 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse0 1) c_~N~0)))) (< c_~i~0 c_~N~0) .cse3 .cse4) (= c_~q1_front~0 0) (= 0 (select .cse1 0)) (<= 1 c_~N~0) (= c_~q2_front~0 0) (or (< c_~j~0 c_~N~0) (and (<= c_~i~0 c_~j~0) (< c_~j~0 .cse5))) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) .cse3 (let ((.cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_421 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_421))) (or (not (= c_~i~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse11 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse8 (select .cse11 ~q1~0.base))) (or (< (select .cse8 .cse9) c_~i~0) (not (= c_~j~0 (select .cse8 .cse10))) (< (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) .cse5)))))))) (forall ((v_ArrVal_421 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_421))) (or (not (= c_~i~0 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse14 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse15 (select .cse14 ~q1~0.base))) (or (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) c_~i~0) (not (= c_~j~0 (select .cse15 .cse10))) (< (select .cse15 .cse9) .cse5)))))))))) .cse4))) is different from false [2023-01-27 23:04:39,043 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~q2~0.base)) (.cse4 (<= c_~n2~0 c_~q2_front~0)) (.cse6 (+ c_~i~0 1)) (.cse3 (* c_~q2_front~0 4)) (.cse5 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (= (select (select |c_#memory_int| c_~q1~0.base) 0) 0) (= c_~q1~0.offset 0) (= c_~q1_front~0 0) (or (let ((.cse1 (select .cse2 (+ c_~q2~0.offset .cse3)))) (let ((.cse0 (< (+ .cse1 1) c_~N~0))) (and (or .cse0 (< .cse1 c_~i~0)) (or (< c_~i~0 (+ c_~N~0 1)) .cse0)))) .cse4 .cse5) (= 0 (select .cse2 0)) (<= 1 c_~N~0) (= c_~q2_front~0 0) (or (< c_~j~0 c_~N~0) (and (<= c_~i~0 c_~j~0) (< c_~j~0 .cse6))) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) .cse4 (let ((.cse8 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_421 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_421))) (or (not (= c_~i~0 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse9 (select .cse12 ~q1~0.base))) (or (< (select .cse9 .cse10) c_~i~0) (not (= c_~j~0 (select .cse9 .cse11))) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) .cse6)))))))) (forall ((v_ArrVal_421 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_421))) (or (not (= c_~i~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8))) (forall ((~q1~0.base Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422))) (let ((.cse16 (select .cse15 ~q1~0.base))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) c_~i~0) (not (= c_~j~0 (select .cse16 .cse11))) (< (select .cse16 .cse10) .cse6)))))))))) .cse5))) is different from false [2023-01-27 23:04:40,577 INFO L130 PetriNetUnfolder]: 1631/3025 cut-off events. [2023-01-27 23:04:40,577 INFO L131 PetriNetUnfolder]: For 56810/56810 co-relation queries the response was YES. [2023-01-27 23:04:40,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26309 conditions, 3025 events. 1631/3025 cut-off events. For 56810/56810 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 19640 event pairs, 92 based on Foata normal form. 19/3042 useless extension candidates. Maximal degree in co-relation 25925. Up to 962 conditions per place. [2023-01-27 23:04:40,601 INFO L137 encePairwiseOnDemand]: 317/334 looper letters, 214 selfloop transitions, 557 changer transitions 24/795 dead transitions. [2023-01-27 23:04:40,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 795 transitions, 13938 flow [2023-01-27 23:04:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-01-27 23:04:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-01-27 23:04:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 6165 transitions. [2023-01-27 23:04:40,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2563622754491018 [2023-01-27 23:04:40,607 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 6165 transitions. [2023-01-27 23:04:40,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 6165 transitions. [2023-01-27 23:04:40,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:04:40,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 6165 transitions. [2023-01-27 23:04:40,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 85.625) internal successors, (6165), 72 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:40,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 334.0) internal successors, (24382), 73 states have internal predecessors, (24382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:40,625 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 334.0) internal successors, (24382), 73 states have internal predecessors, (24382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:40,626 INFO L175 Difference]: Start difference. First operand has 261 places, 493 transitions, 8236 flow. Second operand 72 states and 6165 transitions. [2023-01-27 23:04:40,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 795 transitions, 13938 flow [2023-01-27 23:04:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 795 transitions, 13714 flow, removed 74 selfloop flow, removed 11 redundant places. [2023-01-27 23:04:40,912 INFO L231 Difference]: Finished difference. Result has 340 places, 636 transitions, 12253 flow [2023-01-27 23:04:40,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7603, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=12253, PETRI_PLACES=340, PETRI_TRANSITIONS=636} [2023-01-27 23:04:40,913 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 318 predicate places. [2023-01-27 23:04:40,913 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 636 transitions, 12253 flow [2023-01-27 23:04:40,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 82.52777777777777) internal successors, (2971), 36 states have internal predecessors, (2971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:40,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:04:40,914 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:04:40,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 23:04:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:04:41,118 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:04:41,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:04:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 419130414, now seen corresponding path program 10 times [2023-01-27 23:04:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:04:41,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549996420] [2023-01-27 23:04:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:04:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:04:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:04:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:04:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:04:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549996420] [2023-01-27 23:04:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549996420] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:04:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442137839] [2023-01-27 23:04:42,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 23:04:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:04:42,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:04:42,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:04:42,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 23:04:42,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 23:04:42,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:04:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-27 23:04:42,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:04:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:04:42,368 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-01-27 23:04:42,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2023-01-27 23:04:42,459 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 23:04:42,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 23:04:42,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 23:04:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:04:42,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:04:43,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:43,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 288 [2023-01-27 23:04:43,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:43,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 196 [2023-01-27 23:04:43,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:04:43,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 178 [2023-01-27 23:04:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:04:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442137839] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:04:49,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:04:49,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 32 [2023-01-27 23:04:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216152074] [2023-01-27 23:04:49,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:04:49,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-27 23:04:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:04:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-27 23:04:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1001, Unknown=1, NotChecked=0, Total=1122 [2023-01-27 23:04:49,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-27 23:04:49,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 636 transitions, 12253 flow. Second operand has 34 states, 34 states have (on average 79.58823529411765) internal successors, (2706), 34 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:04:49,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:04:49,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-27 23:04:49,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:05:16,914 WARN L222 SmtUtils]: Spent 22.57s on a formula simplification. DAG size of input: 100 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 23:05:20,442 INFO L130 PetriNetUnfolder]: 2628/4842 cut-off events. [2023-01-27 23:05:20,442 INFO L131 PetriNetUnfolder]: For 157068/157068 co-relation queries the response was YES. [2023-01-27 23:05:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51082 conditions, 4842 events. 2628/4842 cut-off events. For 157068/157068 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 34571 event pairs, 193 based on Foata normal form. 51/4890 useless extension candidates. Maximal degree in co-relation 50740. Up to 1387 conditions per place. [2023-01-27 23:05:20,483 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 419 selfloop transitions, 746 changer transitions 32/1197 dead transitions. [2023-01-27 23:05:20,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1197 transitions, 25004 flow [2023-01-27 23:05:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-01-27 23:05:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-01-27 23:05:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 5584 transitions. [2023-01-27 23:05:20,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24953078916793278 [2023-01-27 23:05:20,489 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 5584 transitions. [2023-01-27 23:05:20,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 5584 transitions. [2023-01-27 23:05:20,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:05:20,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 5584 transitions. [2023-01-27 23:05:20,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 83.34328358208955) internal successors, (5584), 67 states have internal predecessors, (5584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:05:20,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 334.0) internal successors, (22712), 68 states have internal predecessors, (22712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:05:20,506 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 334.0) internal successors, (22712), 68 states have internal predecessors, (22712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:05:20,506 INFO L175 Difference]: Start difference. First operand has 340 places, 636 transitions, 12253 flow. Second operand 67 states and 5584 transitions. [2023-01-27 23:05:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1197 transitions, 25004 flow [2023-01-27 23:05:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1197 transitions, 23698 flow, removed 493 selfloop flow, removed 32 redundant places. [2023-01-27 23:05:21,280 INFO L231 Difference]: Finished difference. Result has 389 places, 982 transitions, 21460 flow [2023-01-27 23:05:21,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10386, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=21460, PETRI_PLACES=389, PETRI_TRANSITIONS=982} [2023-01-27 23:05:21,281 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 367 predicate places. [2023-01-27 23:05:21,281 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 982 transitions, 21460 flow [2023-01-27 23:05:21,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 79.58823529411765) internal successors, (2706), 34 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:05:21,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:05:21,281 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:05:21,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 23:05:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 23:05:21,485 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:05:21,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:05:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910212, now seen corresponding path program 11 times [2023-01-27 23:05:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:05:21,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208089396] [2023-01-27 23:05:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:05:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:05:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:05:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:05:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:05:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208089396] [2023-01-27 23:05:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208089396] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:05:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810727576] [2023-01-27 23:05:22,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 23:05:22,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:05:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:05:22,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:05:22,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 23:05:22,861 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 23:05:22,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:05:22,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-27 23:05:22,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:05:22,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:05:22,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:05:22,890 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 23:05:22,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 23:05:22,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:05:23,035 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 23:05:23,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 23:05:23,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:05:23,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:05:23,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:05:23,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:05:23,575 INFO L321 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-01-27 23:05:23,575 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 60 treesize of output 43 [2023-01-27 23:05:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:05:23,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:05:24,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:05:24,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 114 [2023-01-27 23:05:25,075 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-27 23:05:25,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15651 treesize of output 14635 [2023-01-27 23:05:25,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:05:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2045 treesize of output 1669 [2023-01-27 23:05:25,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:05:25,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1589 treesize of output 1441 [2023-01-27 23:05:25,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:05:25,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1314 treesize of output 1280 [2023-01-27 23:09:07,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:09:07,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 97 [2023-01-27 23:09:07,080 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2023-01-27 23:09:07,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1255 treesize of output 1278 [2023-01-27 23:09:07,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:09:07,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:09:07,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 575 treesize of output 551 [2023-01-27 23:09:07,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:09:07,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:09:07,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 360 treesize of output 408 [2023-01-27 23:09:07,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:09:07,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:09:07,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 408 treesize of output 432 [2023-01-27 23:10:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:10:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810727576] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:10:05,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:10:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2023-01-27 23:10:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250872668] [2023-01-27 23:10:05,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:10:05,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 23:10:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:10:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 23:10:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1114, Unknown=12, NotChecked=0, Total=1260 [2023-01-27 23:10:05,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-27 23:10:05,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 982 transitions, 21460 flow. Second operand has 36 states, 36 states have (on average 80.52777777777777) internal successors, (2899), 36 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:10:05,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:10:05,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-27 23:10:05,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:10:08,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 23:10:14,897 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| c_~q1~0.base)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (let ((.cse27 (select .cse31 .cse10))) (let ((.cse19 (< .cse27 c_~N~0)) (.cse18 (+ .cse27 1)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse4 (< c_~q1_back~0 0)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ c_~j~0 1)) (.cse6 (* c_~q2_back~0 4)) (.cse7 (* c_~q2_front~0 4))) (and (or .cse0 .cse1 .cse2 (and (< c_~i~0 .cse3) (= c_~q2_front~0 c_~q2_back~0) (or (< c_~i~0 c_~j~0) (= c_~q1_back~0 c_~q1_front~0))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0)))) (or .cse0 .cse1 (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse9 (select .cse8 c_~q1~0.base))) (or (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse5 (select .cse8 ~q2~0.base))) (or (not (= c_~i~0 (select .cse5 (+ ~q2~0.offset .cse6)))) (< (select .cse5 (+ ~q2~0.offset .cse7)) c_~j~0)))) (< (select .cse9 .cse10) .cse3) (not (= c_~j~0 (select .cse9 .cse11))))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse12 (select .cse15 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse12 .cse11))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse14 (select .cse15 ~q2~0.base))) (let ((.cse13 (select .cse14 (+ ~q2~0.offset .cse7)))) (or (< .cse13 (+ (select .cse12 .cse10) 1)) (not (= c_~i~0 (select .cse14 (+ ~q2~0.offset .cse6)))) (< .cse13 c_~j~0)))))))))) .cse2 .cse4) (or .cse1 .cse2 (let ((.cse17 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset .cse7)))) (let ((.cse16 (< (+ .cse17 1) c_~N~0))) (and (or .cse16 (< .cse17 .cse18)) (or .cse19 .cse16))))) (or .cse0 .cse1 .cse2 .cse4 (and (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse21 (select .cse23 c_~q1~0.base))) (or (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse22 (select .cse23 ~q2~0.base))) (let ((.cse20 (select .cse22 (+ ~q2~0.offset .cse7)))) (or (< .cse20 (+ 1 (select .cse21 .cse10))) (< .cse20 c_~j~0) (not (= (select .cse22 (+ ~q2~0.offset .cse6)) c_~i~0)))))) (not (= (select .cse21 .cse11) c_~j~0)))))) (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (or (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse24 (select .cse25 ~q2~0.base))) (or (< (select .cse24 (+ ~q2~0.offset .cse7)) c_~j~0) (not (= (select .cse24 (+ ~q2~0.offset .cse6)) c_~i~0))))) (not (= (select .cse26 .cse11) c_~j~0)) (< (select .cse26 .cse10) .cse3))))))) (or .cse1 (and (< .cse27 c_~j~0) (<= c_~j~0 .cse18)) .cse2 (< c_~j~0 c_~N~0)) (or .cse1 (and (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse29 (select |c_#memory_int| ~q2~0.base))) (let ((.cse28 (select .cse29 (+ ~q2~0.offset .cse7)))) (or (< (+ .cse28 1) c_~N~0) (not (= c_~i~0 (select .cse29 (+ ~q2~0.offset .cse6)))) (< .cse28 .cse18))))) (or .cse19 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse30 (select |c_#memory_int| ~q2~0.base))) (or (< (+ (select .cse30 (+ ~q2~0.offset .cse7)) 1) c_~N~0) (not (= c_~i~0 (select .cse30 (+ ~q2~0.offset .cse6))))))))) .cse2) (< c_~i~0 (+ c_~N~0 1)) (<= c_~j~0 1) (or (not (= (select .cse31 .cse11) c_~j~0)) .cse0 .cse1 .cse2 .cse4 (and (or (< .cse27 .cse3) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse32 (select |c_#memory_int| ~q2~0.base))) (or (< (select .cse32 (+ ~q2~0.offset .cse7)) c_~j~0) (not (= c_~i~0 (select .cse32 (+ ~q2~0.offset .cse6)))))))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse34 (select |c_#memory_int| ~q2~0.base))) (let ((.cse33 (select .cse34 (+ ~q2~0.offset .cse7)))) (or (< .cse33 c_~j~0) (not (= c_~i~0 (select .cse34 (+ ~q2~0.offset .cse6)))) (< .cse33 .cse18))))))) (or .cse0 .cse1 .cse2 .cse4 (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse35 (select .cse38 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse35 .cse11))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse37 (select .cse38 ~q2~0.base))) (let ((.cse36 (select .cse37 (+ ~q2~0.offset .cse7)))) (or (< .cse36 (+ (select .cse35 .cse10) 1)) (not (= (select .cse37 (+ ~q2~0.offset .cse6)) c_~i~0)) (< .cse36 c_~j~0))))))))) (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519))) (let ((.cse39 (select .cse41 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse39 .cse11))) (< (select .cse39 .cse10) .cse3) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse40 (select .cse41 ~q2~0.base))) (or (not (= (select .cse40 (+ ~q2~0.offset .cse6)) c_~i~0)) (< (select .cse40 (+ ~q2~0.offset .cse7)) c_~j~0)))))))))) (<= 1 c_~i~0))))) is different from false [2023-01-27 23:10:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 23:10:28,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 23:10:37,105 INFO L130 PetriNetUnfolder]: 3534/6556 cut-off events. [2023-01-27 23:10:37,106 INFO L131 PetriNetUnfolder]: For 274731/274731 co-relation queries the response was YES. [2023-01-27 23:10:37,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76107 conditions, 6556 events. 3534/6556 cut-off events. For 274731/274731 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 49351 event pairs, 217 based on Foata normal form. 13/6569 useless extension candidates. Maximal degree in co-relation 75529. Up to 2741 conditions per place. [2023-01-27 23:10:37,170 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 527 selfloop transitions, 968 changer transitions 34/1529 dead transitions. [2023-01-27 23:10:37,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1529 transitions, 35713 flow [2023-01-27 23:10:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-01-27 23:10:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-01-27 23:10:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 5656 transitions. [2023-01-27 23:10:37,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2527482348735365 [2023-01-27 23:10:37,175 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 5656 transitions. [2023-01-27 23:10:37,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 5656 transitions. [2023-01-27 23:10:37,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:10:37,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 5656 transitions. [2023-01-27 23:10:37,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 84.41791044776119) internal successors, (5656), 67 states have internal predecessors, (5656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:10:37,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 334.0) internal successors, (22712), 68 states have internal predecessors, (22712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:10:37,193 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 334.0) internal successors, (22712), 68 states have internal predecessors, (22712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:10:37,193 INFO L175 Difference]: Start difference. First operand has 389 places, 982 transitions, 21460 flow. Second operand 67 states and 5656 transitions. [2023-01-27 23:10:37,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1529 transitions, 35713 flow [2023-01-27 23:10:39,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 1529 transitions, 34557 flow, removed 538 selfloop flow, removed 14 redundant places. [2023-01-27 23:10:39,037 INFO L231 Difference]: Finished difference. Result has 470 places, 1309 transitions, 32062 flow [2023-01-27 23:10:39,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=20716, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=675, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=32062, PETRI_PLACES=470, PETRI_TRANSITIONS=1309} [2023-01-27 23:10:39,038 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 448 predicate places. [2023-01-27 23:10:39,038 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 1309 transitions, 32062 flow [2023-01-27 23:10:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 80.52777777777777) internal successors, (2899), 36 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:10:39,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:10:39,038 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:10:39,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-27 23:10:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 23:10:39,239 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:10:39,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:10:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1886102747, now seen corresponding path program 12 times [2023-01-27 23:10:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:10:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58278208] [2023-01-27 23:10:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:10:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:10:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:10:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:10:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:10:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58278208] [2023-01-27 23:10:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58278208] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:10:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818084369] [2023-01-27 23:10:40,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 23:10:40,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:10:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:10:40,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:10:40,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 23:10:40,424 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 23:10:40,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:10:40,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-27 23:10:40,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:10:40,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:10:40,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:10:40,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:10:40,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:10:40,876 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 60 treesize of output 40 [2023-01-27 23:10:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:10:40,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:10:41,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:10:41,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2023-01-27 23:10:41,764 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-27 23:10:41,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 343 [2023-01-27 23:10:41,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:10:41,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 287 [2023-01-27 23:10:41,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:10:41,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 217 [2023-01-27 23:11:12,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:12,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2023-01-27 23:11:12,690 INFO L321 Elim1Store]: treesize reduction 51, result has 45.2 percent of original size [2023-01-27 23:11:12,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 296 [2023-01-27 23:11:12,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:11:12,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:11:12,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:12,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 239 [2023-01-27 23:11:12,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:11:12,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:11:12,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:12,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 161 treesize of output 169 [2023-01-27 23:11:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:11:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818084369] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:11:13,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:11:13,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2023-01-27 23:11:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792880917] [2023-01-27 23:11:13,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:11:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 23:11:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:11:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 23:11:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1086, Unknown=4, NotChecked=0, Total=1260 [2023-01-27 23:11:13,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-27 23:11:13,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1309 transitions, 32062 flow. Second operand has 36 states, 36 states have (on average 82.52777777777777) internal successors, (2971), 36 states have internal predecessors, (2971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:11:13,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:11:13,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-27 23:11:13,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:11:28,279 INFO L130 PetriNetUnfolder]: 4462/8382 cut-off events. [2023-01-27 23:11:28,280 INFO L131 PetriNetUnfolder]: For 459931/459931 co-relation queries the response was YES. [2023-01-27 23:11:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106957 conditions, 8382 events. 4462/8382 cut-off events. For 459931/459931 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 66842 event pairs, 267 based on Foata normal form. 42/8424 useless extension candidates. Maximal degree in co-relation 105823. Up to 2325 conditions per place. [2023-01-27 23:11:28,380 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 313 selfloop transitions, 1606 changer transitions 55/1974 dead transitions. [2023-01-27 23:11:28,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 1974 transitions, 50791 flow [2023-01-27 23:11:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-27 23:11:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-01-27 23:11:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 7974 transitions. [2023-01-27 23:11:28,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25671238168823646 [2023-01-27 23:11:28,387 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 7974 transitions. [2023-01-27 23:11:28,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 7974 transitions. [2023-01-27 23:11:28,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:11:28,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 7974 transitions. [2023-01-27 23:11:28,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 85.74193548387096) internal successors, (7974), 93 states have internal predecessors, (7974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:11:28,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 334.0) internal successors, (31396), 94 states have internal predecessors, (31396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:11:28,413 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 334.0) internal successors, (31396), 94 states have internal predecessors, (31396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:11:28,413 INFO L175 Difference]: Start difference. First operand has 470 places, 1309 transitions, 32062 flow. Second operand 93 states and 7974 transitions. [2023-01-27 23:11:28,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 1974 transitions, 50791 flow [2023-01-27 23:11:32,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 1974 transitions, 49733 flow, removed 501 selfloop flow, removed 15 redundant places. [2023-01-27 23:11:32,693 INFO L231 Difference]: Finished difference. Result has 575 places, 1721 transitions, 47320 flow [2023-01-27 23:11:32,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=31216, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=47320, PETRI_PLACES=575, PETRI_TRANSITIONS=1721} [2023-01-27 23:11:32,694 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 553 predicate places. [2023-01-27 23:11:32,694 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 1721 transitions, 47320 flow [2023-01-27 23:11:32,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 82.52777777777777) internal successors, (2971), 36 states have internal predecessors, (2971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:11:32,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:11:32,695 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:11:32,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 23:11:32,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 23:11:32,895 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:11:32,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:11:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 346404087, now seen corresponding path program 13 times [2023-01-27 23:11:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:11:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517851230] [2023-01-27 23:11:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:11:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:11:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:11:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:11:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:11:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517851230] [2023-01-27 23:11:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517851230] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:11:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708339105] [2023-01-27 23:11:34,177 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 23:11:34,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:11:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:11:34,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:11:34,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 23:11:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:11:34,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 57 conjunts are in the unsatisfiable core [2023-01-27 23:11:34,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:11:34,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:11:34,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:11:34,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:11:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:11:34,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:11:35,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:35,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 99 [2023-01-27 23:11:35,560 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-27 23:11:35,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1257 treesize of output 1177 [2023-01-27 23:11:35,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:35,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 529 treesize of output 543 [2023-01-27 23:11:35,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:11:35,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 474 treesize of output 422 [2023-01-27 23:12:10,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:10,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2023-01-27 23:12:10,759 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-27 23:12:10,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 447 treesize of output 422 [2023-01-27 23:12:10,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:12:10,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:12:10,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:10,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 184 [2023-01-27 23:12:10,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:12:10,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:12:10,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:10,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 210 treesize of output 178 [2023-01-27 23:12:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 23:12:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708339105] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:12:11,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:12:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 34 [2023-01-27 23:12:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350788609] [2023-01-27 23:12:11,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:12:11,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 23:12:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:12:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 23:12:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1083, Unknown=4, NotChecked=0, Total=1260 [2023-01-27 23:12:11,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-27 23:12:11,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 1721 transitions, 47320 flow. Second operand has 36 states, 36 states have (on average 82.55555555555556) internal successors, (2972), 36 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:12:11,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:12:11,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-27 23:12:11,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:12:16,943 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~j~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse3 (select |c_#memory_int| c_~q2~0.base)) (.cse2 (< c_~j~0 (+ c_~i~0 1))) (.cse8 (* c_~q1_front~0 4))) (and (= c_~q2~0.offset 0) (or .cse0 (and (< c_~i~0 .cse1) (= c_~q2_front~0 c_~q2_back~0) .cse2 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0)) (= c_~q1~0.offset 0) (< 0 (+ c_~q2_front~0 1)) (<= c_~i~0 c_~j~0) (<= c_~q2_front~0 0) (= 0 (select .cse3 0)) (<= 1 c_~N~0) (or (let ((.cse5 (* c_~q1_back~0 4)) (.cse7 (select .cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (and (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~q1~0.base))) (let ((.cse6 (select .cse4 (+ .cse8 ~q1~0.offset)))) (or (not (= (select .cse4 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< .cse6 c_~j~0) (< .cse6 (+ .cse7 1)))))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse9 (select |c_#memory_int| ~q1~0.base))) (or (not (= (select .cse9 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse9 (+ .cse8 ~q1~0.offset)) c_~j~0)))) (< .cse7 .cse1)))) .cse0 (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select .cse3 (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) .cse2 (= (select (select |c_#memory_int| c_~q1~0.base) .cse8) 0) (<= c_~i~0 1))) is different from false [2023-01-27 23:12:25,195 INFO L130 PetriNetUnfolder]: 5350/10076 cut-off events. [2023-01-27 23:12:25,195 INFO L131 PetriNetUnfolder]: For 787246/787246 co-relation queries the response was YES. [2023-01-27 23:12:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144461 conditions, 10076 events. 5350/10076 cut-off events. For 787246/787246 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 83272 event pairs, 356 based on Foata normal form. 24/10100 useless extension candidates. Maximal degree in co-relation 143449. Up to 3390 conditions per place. [2023-01-27 23:12:25,331 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 470 selfloop transitions, 1830 changer transitions 26/2326 dead transitions. [2023-01-27 23:12:25,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 2326 transitions, 68274 flow [2023-01-27 23:12:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-01-27 23:12:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-01-27 23:12:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5849 transitions. [2023-01-27 23:12:25,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2575290595280028 [2023-01-27 23:12:25,337 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 5849 transitions. [2023-01-27 23:12:25,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 5849 transitions. [2023-01-27 23:12:25,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:12:25,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 5849 transitions. [2023-01-27 23:12:25,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 86.01470588235294) internal successors, (5849), 68 states have internal predecessors, (5849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:12:25,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 334.0) internal successors, (23046), 69 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:12:25,354 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 334.0) internal successors, (23046), 69 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:12:25,355 INFO L175 Difference]: Start difference. First operand has 575 places, 1721 transitions, 47320 flow. Second operand 68 states and 5849 transitions. [2023-01-27 23:12:25,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 2326 transitions, 68274 flow [2023-01-27 23:12:33,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 2326 transitions, 62959 flow, removed 1878 selfloop flow, removed 21 redundant places. [2023-01-27 23:12:33,494 INFO L231 Difference]: Finished difference. Result has 619 places, 2076 transitions, 60894 flow [2023-01-27 23:12:33,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=40258, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=60894, PETRI_PLACES=619, PETRI_TRANSITIONS=2076} [2023-01-27 23:12:33,495 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 597 predicate places. [2023-01-27 23:12:33,495 INFO L495 AbstractCegarLoop]: Abstraction has has 619 places, 2076 transitions, 60894 flow [2023-01-27 23:12:33,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 82.55555555555556) internal successors, (2972), 36 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:12:33,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:12:33,496 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:12:33,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-27 23:12:33,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:12:33,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:12:33,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:12:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1843840762, now seen corresponding path program 14 times [2023-01-27 23:12:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:12:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412115807] [2023-01-27 23:12:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:12:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:12:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:12:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:12:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:12:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412115807] [2023-01-27 23:12:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412115807] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:12:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586223836] [2023-01-27 23:12:35,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 23:12:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:12:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:12:35,712 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:12:35,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 23:12:35,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 23:12:35,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:12:35,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-27 23:12:35,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:12:36,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:12:36,061 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 29 treesize of output 29 [2023-01-27 23:12:36,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:36,267 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 60 treesize of output 40 [2023-01-27 23:12:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 23:12:36,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:12:36,787 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_662 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_662))) (or (< (+ (select (select .cse0 c_~q2~0.base) .cse1) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< (select .cse2 (+ .cse3 ~q1~0.offset)) c_~N~0) (not (= (select .cse2 (+ .cse4 ~q1~0.offset)) c_~j~0)))))))) (forall ((v_ArrVal_662 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_662))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (< (+ (select .cse5 (+ .cse3 ~q1~0.offset)) 1) c_~N~0) (not (= (select .cse5 (+ .cse4 ~q1~0.offset)) c_~j~0))))) (< (select (select .cse6 c_~q2~0.base) .cse1) c_~N~0)))))) is different from false [2023-01-27 23:12:36,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:36,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-01-27 23:12:36,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:36,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 166 [2023-01-27 23:12:37,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:12:37,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 148 [2023-01-27 23:14:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 23:14:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586223836] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:14:03,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:14:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2023-01-27 23:14:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715830718] [2023-01-27 23:14:03,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:14:03,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 23:14:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:14:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 23:14:03,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1089, Unknown=1, NotChecked=66, Total=1260 [2023-01-27 23:14:03,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-27 23:14:03,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 2076 transitions, 60894 flow. Second operand has 36 states, 36 states have (on average 79.55555555555556) internal successors, (2864), 36 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:03,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:14:03,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-27 23:14:03,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:14:11,912 INFO L130 PetriNetUnfolder]: 5644/10655 cut-off events. [2023-01-27 23:14:11,912 INFO L131 PetriNetUnfolder]: For 628421/628421 co-relation queries the response was YES. [2023-01-27 23:14:11,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149478 conditions, 10655 events. 5644/10655 cut-off events. For 628421/628421 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 89810 event pairs, 496 based on Foata normal form. 3/10658 useless extension candidates. Maximal degree in co-relation 148362. Up to 6348 conditions per place. [2023-01-27 23:14:12,049 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 583 selfloop transitions, 1727 changer transitions 11/2321 dead transitions. [2023-01-27 23:14:12,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 2321 transitions, 72562 flow [2023-01-27 23:14:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 23:14:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 23:14:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2875 transitions. [2023-01-27 23:14:12,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24593669803250642 [2023-01-27 23:14:12,052 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2875 transitions. [2023-01-27 23:14:12,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2875 transitions. [2023-01-27 23:14:12,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:14:12,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2875 transitions. [2023-01-27 23:14:12,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 82.14285714285714) internal successors, (2875), 35 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:12,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:12,063 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:12,063 INFO L175 Difference]: Start difference. First operand has 619 places, 2076 transitions, 60894 flow. Second operand 35 states and 2875 transitions. [2023-01-27 23:14:12,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 2321 transitions, 72562 flow [2023-01-27 23:14:21,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 2321 transitions, 70900 flow, removed 785 selfloop flow, removed 12 redundant places. [2023-01-27 23:14:21,542 INFO L231 Difference]: Finished difference. Result has 651 places, 2240 transitions, 70448 flow [2023-01-27 23:14:21,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=59664, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1575, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=70448, PETRI_PLACES=651, PETRI_TRANSITIONS=2240} [2023-01-27 23:14:21,544 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 629 predicate places. [2023-01-27 23:14:21,544 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 2240 transitions, 70448 flow [2023-01-27 23:14:21,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 79.55555555555556) internal successors, (2864), 36 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:21,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:14:21,545 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:14:21,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 23:14:21,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:21,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:14:21,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:14:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -200779307, now seen corresponding path program 15 times [2023-01-27 23:14:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:14:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162647451] [2023-01-27 23:14:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:14:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:14:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:14:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 23:14:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:14:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162647451] [2023-01-27 23:14:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162647451] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:14:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386314543] [2023-01-27 23:14:21,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 23:14:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:14:21,847 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:14:21,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 23:14:22,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 23:14:22,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:14:22,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 23:14:22,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:14:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:14:22,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:14:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 23:14:22,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386314543] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:14:22,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:14:22,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-27 23:14:22,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934708175] [2023-01-27 23:14:22,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:14:22,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 23:14:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:14:22,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 23:14:22,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-01-27 23:14:22,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 334 [2023-01-27 23:14:22,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 2240 transitions, 70448 flow. Second operand has 16 states, 16 states have (on average 121.3125) internal successors, (1941), 16 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:22,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:14:22,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 334 [2023-01-27 23:14:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:14:26,095 INFO L130 PetriNetUnfolder]: 2664/5461 cut-off events. [2023-01-27 23:14:26,095 INFO L131 PetriNetUnfolder]: For 313739/313739 co-relation queries the response was YES. [2023-01-27 23:14:26,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77415 conditions, 5461 events. 2664/5461 cut-off events. For 313739/313739 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 44397 event pairs, 577 based on Foata normal form. 557/6018 useless extension candidates. Maximal degree in co-relation 77245. Up to 1817 conditions per place. [2023-01-27 23:14:26,163 INFO L137 encePairwiseOnDemand]: 326/334 looper letters, 733 selfloop transitions, 109 changer transitions 286/1128 dead transitions. [2023-01-27 23:14:26,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 1128 transitions, 37290 flow [2023-01-27 23:14:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 23:14:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 23:14:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2478 transitions. [2023-01-27 23:14:26,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709580838323353 [2023-01-27 23:14:26,165 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2478 transitions. [2023-01-27 23:14:26,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2478 transitions. [2023-01-27 23:14:26,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:14:26,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2478 transitions. [2023-01-27 23:14:26,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 123.9) internal successors, (2478), 20 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:26,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 334.0) internal successors, (7014), 21 states have internal predecessors, (7014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:26,170 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 334.0) internal successors, (7014), 21 states have internal predecessors, (7014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:26,170 INFO L175 Difference]: Start difference. First operand has 651 places, 2240 transitions, 70448 flow. Second operand 20 states and 2478 transitions. [2023-01-27 23:14:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 1128 transitions, 37290 flow [2023-01-27 23:14:29,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 1128 transitions, 33221 flow, removed 899 selfloop flow, removed 63 redundant places. [2023-01-27 23:14:29,207 INFO L231 Difference]: Finished difference. Result has 523 places, 709 transitions, 20361 flow [2023-01-27 23:14:29,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=25428, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=20361, PETRI_PLACES=523, PETRI_TRANSITIONS=709} [2023-01-27 23:14:29,208 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 501 predicate places. [2023-01-27 23:14:29,208 INFO L495 AbstractCegarLoop]: Abstraction has has 523 places, 709 transitions, 20361 flow [2023-01-27 23:14:29,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 121.3125) internal successors, (1941), 16 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:29,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:14:29,208 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:14:29,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-27 23:14:29,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-01-27 23:14:29,409 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:14:29,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:14:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 345660730, now seen corresponding path program 16 times [2023-01-27 23:14:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:14:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390865838] [2023-01-27 23:14:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:14:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:14:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:14:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 23:14:29,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:14:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390865838] [2023-01-27 23:14:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390865838] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:14:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116729763] [2023-01-27 23:14:29,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 23:14:29,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:29,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:14:29,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:14:29,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 23:14:29,577 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 23:14:29,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:14:29,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 23:14:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:14:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 23:14:29,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:14:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 23:14:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116729763] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:14:29,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:14:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 10 [2023-01-27 23:14:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371466060] [2023-01-27 23:14:29,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:14:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 23:14:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:14:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 23:14:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-01-27 23:14:29,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 334 [2023-01-27 23:14:29,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 709 transitions, 20361 flow. Second operand has 11 states, 11 states have (on average 126.0909090909091) internal successors, (1387), 11 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:29,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:14:29,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 334 [2023-01-27 23:14:29,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:14:30,633 INFO L130 PetriNetUnfolder]: 1207/2658 cut-off events. [2023-01-27 23:14:30,633 INFO L131 PetriNetUnfolder]: For 123731/123731 co-relation queries the response was YES. [2023-01-27 23:14:30,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30761 conditions, 2658 events. 1207/2658 cut-off events. For 123731/123731 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19894 event pairs, 393 based on Foata normal form. 348/3006 useless extension candidates. Maximal degree in co-relation 30631. Up to 1193 conditions per place. [2023-01-27 23:14:30,659 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 279 selfloop transitions, 82 changer transitions 207/568 dead transitions. [2023-01-27 23:14:30,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 568 transitions, 15809 flow [2023-01-27 23:14:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 23:14:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 23:14:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1408 transitions. [2023-01-27 23:14:30,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38323353293413176 [2023-01-27 23:14:30,661 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1408 transitions. [2023-01-27 23:14:30,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1408 transitions. [2023-01-27 23:14:30,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:14:30,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1408 transitions. [2023-01-27 23:14:30,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:30,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 334.0) internal successors, (4008), 12 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:30,664 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 334.0) internal successors, (4008), 12 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:30,664 INFO L175 Difference]: Start difference. First operand has 523 places, 709 transitions, 20361 flow. Second operand 11 states and 1408 transitions. [2023-01-27 23:14:30,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 568 transitions, 15809 flow [2023-01-27 23:14:31,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 568 transitions, 13694 flow, removed 421 selfloop flow, removed 73 redundant places. [2023-01-27 23:14:31,255 INFO L231 Difference]: Finished difference. Result has 369 places, 287 transitions, 7014 flow [2023-01-27 23:14:31,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10125, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7014, PETRI_PLACES=369, PETRI_TRANSITIONS=287} [2023-01-27 23:14:31,255 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 347 predicate places. [2023-01-27 23:14:31,255 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 287 transitions, 7014 flow [2023-01-27 23:14:31,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 126.0909090909091) internal successors, (1387), 11 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:14:31,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:14:31,256 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:14:31,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-27 23:14:31,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:31,456 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 23:14:31,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:14:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1446463265, now seen corresponding path program 17 times [2023-01-27 23:14:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:14:31,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901422980] [2023-01-27 23:14:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:14:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:14:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:14:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:14:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:14:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901422980] [2023-01-27 23:14:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901422980] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:14:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739529372] [2023-01-27 23:14:32,808 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 23:14:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:14:32,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:14:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 23:14:32,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 23:14:32,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:14:32,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 62 conjunts are in the unsatisfiable core [2023-01-27 23:14:32,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:14:32,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:14:32,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:14:32,920 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 23:14:32,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 23:14:32,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 23:14:33,012 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 23:14:33,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 23:14:33,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:14:33,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:14:33,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:14:33,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:14:33,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 23:14:33,488 INFO L321 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-01-27 23:14:33,488 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 49 treesize of output 40 [2023-01-27 23:14:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:14:33,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:14:42,025 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-27 23:14:42,344 WARN L238 SmtUtils]: Removed 2 from assertion stack [2023-01-27 23:14:42,345 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-27 23:14:42,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-27 23:14:42,360 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 23:14:42,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 23:14:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:14:42,546 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. [2023-01-27 23:14:42,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-27 23:14:42,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-27 23:14:42,548 INFO L445 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1, 1, 1] [2023-01-27 23:14:42,550 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 23:14:42,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 23:14:42,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:14:42 BasicIcfg [2023-01-27 23:14:42,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 23:14:42,552 INFO L158 Benchmark]: Toolchain (without parser) took 810158.01ms. Allocated memory was 325.1MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 271.3MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-27 23:14:42,552 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 23:14:42,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.83ms. Allocated memory is still 325.1MB. Free memory was 271.1MB in the beginning and 259.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 23:14:42,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.85ms. Allocated memory is still 325.1MB. Free memory was 259.5MB in the beginning and 257.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 23:14:42,553 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 325.1MB. Free memory was 257.4MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 23:14:42,553 INFO L158 Benchmark]: RCFGBuilder took 517.90ms. Allocated memory is still 325.1MB. Free memory was 255.5MB in the beginning and 274.0MB in the end (delta: -18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2023-01-27 23:14:42,553 INFO L158 Benchmark]: TraceAbstraction took 809409.07ms. Allocated memory was 325.1MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 273.6MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-27 23:14:42,553 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 181.83ms. Allocated memory is still 325.1MB. Free memory was 271.1MB in the beginning and 259.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.85ms. Allocated memory is still 325.1MB. Free memory was 259.5MB in the beginning and 257.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 325.1MB. Free memory was 257.4MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 517.90ms. Allocated memory is still 325.1MB. Free memory was 255.5MB in the beginning and 274.0MB in the end (delta: -18.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 809409.07ms. Allocated memory was 325.1MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 273.6MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 154 PlacesBefore, 22 PlacesAfterwards, 160 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 7 FixpointIterations, 115 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 164 TotalNumberOfCompositions, 763 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 651, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 269, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 651, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 269, unknown conditional: 0, unknown unconditional: 269] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 22, Positive conditional cache size: 0, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 178 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: 809.3s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 205.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 244 mSolverCounterUnknown, 4800 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4800 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 27.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1295 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18519 IncrementalHoareTripleChecker+Invalid, 21344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1286 mSolverCounterUnsat, 0 mSDtfsCounter, 18519 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1257 GetRequests, 273 SyntacticMatches, 12 SemanticMatches, 972 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 17900 ImplicationChecksByTransitivity, 135.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70448occurred in iteration=20, InterpolantAutomatonStates: 697, 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.0s SatisfiabilityAnalysisTime, 583.7s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 912 ConstructedInterpolants, 85 QuantifiedInterpolants, 27653 SizeOfPredicates, 349 NumberOfNonLiveVariables, 3473 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 50 InterpolantComputations, 8 PerfectInterpolantSequences, 78/247 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