/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -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-28 11:53:41,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 11:53:41,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 11:53:41,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 11:53:41,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 11:53:41,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 11:53:41,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 11:53:41,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 11:53:41,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 11:53:41,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 11:53:41,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 11:53:41,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 11:53:41,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 11:53:41,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 11:53:41,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 11:53:41,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 11:53:41,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 11:53:41,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 11:53:41,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 11:53:41,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 11:53:41,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 11:53:41,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 11:53:41,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 11:53:41,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 11:53:41,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 11:53:41,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 11:53:41,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 11:53:41,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 11:53:41,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 11:53:41,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 11:53:41,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 11:53:41,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 11:53:41,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 11:53:41,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 11:53:41,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 11:53:41,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 11:53:41,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 11:53:41,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 11:53:41,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 11:53:41,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 11:53:41,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 11:53:41,641 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-28 11:53:41,663 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 11:53:41,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 11:53:41,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 11:53:41,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 11:53:41,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 11:53:41,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 11:53:41,664 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 11:53:41,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 11:53:41,664 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 11:53:41,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 11:53:41,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 11:53:41,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:53:41,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 11:53:41,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 11:53:41,666 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 11:53:41,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 11:53:41,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 11:53:41,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 11:53:41,832 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 11:53:41,833 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 11:53:41,833 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-28 11:53:42,797 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 11:53:42,953 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 11:53:42,954 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-28 11:53:42,960 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1aa65e7/1c68af88e210407984660d887e5f6c1d/FLAGeea7545b6 [2023-01-28 11:53:42,973 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1aa65e7/1c68af88e210407984660d887e5f6c1d [2023-01-28 11:53:42,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 11:53:42,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 11:53:42,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 11:53:42,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 11:53:42,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 11:53:42,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:53:42" (1/1) ... [2023-01-28 11:53:42,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f56bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:42, skipping insertion in model container [2023-01-28 11:53:42,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:53:42" (1/1) ... [2023-01-28 11:53:42,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 11:53:42,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 11:53:43,123 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-28 11:53:43,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:53:43,134 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 11:53:43,147 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-28 11:53:43,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:53:43,154 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:53:43,154 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:53:43,159 INFO L208 MainTranslator]: Completed translation [2023-01-28 11:53:43,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43 WrapperNode [2023-01-28 11:53:43,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 11:53:43,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 11:53:43,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 11:53:43,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 11:53:43,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,188 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-01-28 11:53:43,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 11:53:43,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 11:53:43,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 11:53:43,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 11:53:43,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 11:53:43,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 11:53:43,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 11:53:43,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 11:53:43,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (1/1) ... [2023-01-28 11:53:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:53:43,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:53:43,231 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-28 11:53:43,234 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-28 11:53:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 11:53:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 11:53:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 11:53:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 11:53:43,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 11:53:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 11:53:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 11:53:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 11:53:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 11:53:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 11:53:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 11:53:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 11:53:43,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 11:53:43,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 11:53:43,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 11:53:43,260 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 11:53:43,328 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 11:53:43,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 11:53:43,560 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 11:53:43,682 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 11:53:43,682 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 11:53:43,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:53:43 BoogieIcfgContainer [2023-01-28 11:53:43,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 11:53:43,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 11:53:43,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 11:53:43,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 11:53:43,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:53:42" (1/3) ... [2023-01-28 11:53:43,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d90288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:53:43, skipping insertion in model container [2023-01-28 11:53:43,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:53:43" (2/3) ... [2023-01-28 11:53:43,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d90288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:53:43, skipping insertion in model container [2023-01-28 11:53:43,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:53:43" (3/3) ... [2023-01-28 11:53:43,689 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-01-28 11:53:43,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 11:53:43,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 11:53:43,703 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 11:53:43,766 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 11:53:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-01-28 11:53:43,835 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-01-28 11:53:43,835 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 11:53:43,838 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-28 11:53:43,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-01-28 11:53:43,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-01-28 11:53:43,846 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 11:53:43,855 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-28 11:53:43,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-01-28 11:53:43,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-01-28 11:53:43,906 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-01-28 11:53:43,906 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 11:53:43,907 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-28 11:53:43,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-01-28 11:53:47,886 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-01-28 11:53:47,886 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-01-28 11:53:47,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 11:53:47,909 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;@f409582, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 11:53:47,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 11:53:47,934 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-01-28 11:53:47,934 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 11:53:47,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:47,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:53:47,936 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-28 11:53:47,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-01-28 11:53:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408348625] [2023-01-28 11:53:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:48,414 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-28 11:53:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408348625] [2023-01-28 11:53:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408348625] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:48,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:48,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 11:53:48,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977427722] [2023-01-28 11:53:48,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:48,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:53:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:53:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:53:48,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-01-28 11:53:48,446 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-28 11:53:48,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:48,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-01-28 11:53:48,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:48,513 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-01-28 11:53:48,514 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 11:53:48,515 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-28 11:53:48,518 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-01-28 11:53:48,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-01-28 11:53:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:53:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:53:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-01-28 11:53:48,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540918163672655 [2023-01-28 11:53:48,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-01-28 11:53:48,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-01-28 11:53:48,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:48,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-01-28 11:53:48,544 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-28 11:53:48,549 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-28 11:53:48,549 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-28 11:53:48,551 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 455 transitions. [2023-01-28 11:53:48,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-01-28 11:53:48,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 11:53:48,554 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-01-28 11:53:48,555 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-28 11:53:48,559 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-01-28 11:53:48,559 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-01-28 11:53:48,560 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-28 11:53:48,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:48,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:53:48,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 11:53:48,561 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-28 11:53:48,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-01-28 11:53:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439332111] [2023-01-28 11:53:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:48,695 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-28 11:53:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439332111] [2023-01-28 11:53:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439332111] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:48,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:53:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981509811] [2023-01-28 11:53:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:48,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:53:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:53:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:53:48,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 11:53:48,704 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-28 11:53:48,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:48,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 11:53:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:48,779 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-01-28 11:53:48,779 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-01-28 11:53:48,780 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-28 11:53:48,781 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-01-28 11:53:48,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-01-28 11:53:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:53:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:53:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-01-28 11:53:48,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467065868263473 [2023-01-28 11:53:48,784 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-01-28 11:53:48,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-01-28 11:53:48,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:48,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-01-28 11:53:48,786 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-28 11:53:48,788 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-28 11:53:48,789 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-28 11:53:48,789 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 746 transitions. [2023-01-28 11:53:48,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-01-28 11:53:48,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:53:48,791 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-01-28 11:53:48,791 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-28 11:53:48,791 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-01-28 11:53:48,792 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-01-28 11:53:48,792 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-28 11:53:48,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:48,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:53:48,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 11:53:48,792 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-28 11:53:48,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-01-28 11:53:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381681720] [2023-01-28 11:53:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:48,886 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-28 11:53:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381681720] [2023-01-28 11:53:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381681720] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:48,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:53:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217279175] [2023-01-28 11:53:48,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:48,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:53:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:48,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:53:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:53:48,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 11:53:48,890 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-28 11:53:48,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:48,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 11:53:48,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:48,941 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-01-28 11:53:48,942 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-01-28 11:53:48,942 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-28 11:53:48,943 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-01-28 11:53:48,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-01-28 11:53:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:53:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:53:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-01-28 11:53:48,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44461077844311375 [2023-01-28 11:53:48,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-01-28 11:53:48,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-01-28 11:53:48,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:48,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-01-28 11:53:48,947 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-28 11:53:48,949 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-28 11:53:48,949 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-28 11:53:48,949 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 594 transitions. [2023-01-28 11:53:48,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-01-28 11:53:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 11:53:48,951 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-01-28 11:53:48,951 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-28 11:53:48,952 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-28 11:53:48,952 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-01-28 11:53:48,952 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-28 11:53:48,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:48,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:53:48,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 11:53:48,953 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-28 11:53:48,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-01-28 11:53:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366335794] [2023-01-28 11:53:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:49,007 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-28 11:53:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366335794] [2023-01-28 11:53:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366335794] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:49,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:49,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:53:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787548258] [2023-01-28 11:53:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:49,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:53:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:49,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:53:49,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:53:49,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 334 [2023-01-28 11:53:49,010 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-28 11:53:49,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:49,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 334 [2023-01-28 11:53:49,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:49,065 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-01-28 11:53:49,065 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-01-28 11:53:49,066 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-28 11:53:49,067 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-01-28 11:53:49,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-01-28 11:53:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:53:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:53:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2023-01-28 11:53:49,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43892215568862275 [2023-01-28 11:53:49,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2023-01-28 11:53:49,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2023-01-28 11:53:49,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:49,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2023-01-28 11:53:49,071 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-28 11:53:49,073 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-28 11:53:49,074 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-28 11:53:49,074 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 733 transitions. [2023-01-28 11:53:49,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-01-28 11:53:49,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-28 11:53:49,076 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-01-28 11:53:49,076 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-28 11:53:49,076 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-01-28 11:53:49,076 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-01-28 11:53:49,077 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-28 11:53:49,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:49,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:53:49,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 11:53:49,077 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-28 11:53:49,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-01-28 11:53:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362712892] [2023-01-28 11:53:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:49,157 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-28 11:53:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362712892] [2023-01-28 11:53:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362712892] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:49,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:53:49,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068482461] [2023-01-28 11:53:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:49,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:53:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:53:49,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:53:49,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-28 11:53:49,160 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-28 11:53:49,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:49,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-28 11:53:49,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:49,233 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-01-28 11:53:49,233 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-01-28 11:53:49,234 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-28 11:53:49,234 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-01-28 11:53:49,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-01-28 11:53:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:53:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:53:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-01-28 11:53:49,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026946107784431 [2023-01-28 11:53:49,236 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-01-28 11:53:49,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-01-28 11:53:49,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:49,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-01-28 11:53:49,237 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-28 11:53:49,239 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-28 11:53:49,240 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-28 11:53:49,240 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 538 transitions. [2023-01-28 11:53:49,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-01-28 11:53:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 11:53:49,242 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-01-28 11:53:49,242 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-28 11:53:49,243 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-01-28 11:53:49,244 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-01-28 11:53:49,244 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-28 11:53:49,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:49,244 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-28 11:53:49,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 11:53:49,244 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-28 11:53:49,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-01-28 11:53:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631525941] [2023-01-28 11:53:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:49,313 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-28 11:53:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631525941] [2023-01-28 11:53:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631525941] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 11:53:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385595307] [2023-01-28 11:53:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:49,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:53:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:53:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:53:49,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 334 [2023-01-28 11:53:49,319 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-28 11:53:49,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:49,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 334 [2023-01-28 11:53:49,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:49,363 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-01-28 11:53:49,363 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-01-28 11:53:49,364 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-28 11:53:49,364 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-01-28 11:53:49,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-01-28 11:53:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:53:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:53:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-01-28 11:53:49,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40119760479041916 [2023-01-28 11:53:49,366 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-01-28 11:53:49,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-01-28 11:53:49,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:49,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-01-28 11:53:49,367 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-28 11:53:49,369 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-28 11:53:49,369 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-28 11:53:49,369 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 536 transitions. [2023-01-28 11:53:49,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-01-28 11:53:49,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 11:53:49,371 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-01-28 11:53:49,371 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-28 11:53:49,373 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-01-28 11:53:49,373 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-01-28 11:53:49,374 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-28 11:53:49,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:49,374 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-28 11:53:49,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 11:53:49,374 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-28 11:53:49,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-01-28 11:53:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487843417] [2023-01-28 11:53:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:49,483 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-28 11:53:49,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487843417] [2023-01-28 11:53:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487843417] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:53:49,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:53:49,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 11:53:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173055537] [2023-01-28 11:53:49,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:53:49,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:53:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:53:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:53:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:53:49,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-28 11:53:49,485 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-28 11:53:49,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:53:49,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-28 11:53:49,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:53:49,515 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-01-28 11:53:49,516 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-01-28 11:53:49,517 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-28 11:53:49,517 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-01-28 11:53:49,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-01-28 11:53:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:53:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:53:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-01-28 11:53:49,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-01-28 11:53:49,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-01-28 11:53:49,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-01-28 11:53:49,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:53:49,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-01-28 11:53:49,520 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-28 11:53:49,522 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-28 11:53:49,522 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-28 11:53:49,522 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-01-28 11:53:49,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-01-28 11:53:49,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-01-28 11:53:49,523 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-01-28 11:53:49,523 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-28 11:53:49,524 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-01-28 11:53:49,524 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-01-28 11:53:49,524 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-28 11:53:49,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:53:49,525 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-28 11:53:49,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 11:53:49,525 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-28 11:53:49,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:53:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-01-28 11:53:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:53:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264845996] [2023-01-28 11:53:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:53:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:53:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:53:50,563 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-28 11:53:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:53:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264845996] [2023-01-28 11:53:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264845996] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:53:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212903181] [2023-01-28 11:53:50,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:53:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:53:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:53:50,566 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-28 11:53:50,571 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-28 11:53:50,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:53:50,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:53:50,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-01-28 11:53:50,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:53:50,881 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-28 11:53:50,939 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-28 11:53:50,985 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-28 11:53:51,166 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-28 11:53:51,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:53:51,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:53:51,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-01-28 11:53:51,712 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 11:53:51,713 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-28 11:53:51,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:53:51,772 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-28 11:53:51,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:53:51,817 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-28 11:54:23,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:23,177 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-28 11:54:23,212 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-28 11:54:23,212 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-28 11:54:23,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:23,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:23,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:23,254 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-28 11:54:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:23,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:23,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:23,272 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-28 11:54:23,546 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-28 11:54:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212903181] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:54:23,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:54:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-01-28 11:54:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609690871] [2023-01-28 11:54:23,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:54:23,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 11:54:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:54:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 11:54:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=758, Unknown=3, NotChecked=0, Total=870 [2023-01-28 11:54:23,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 11:54:23,551 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-28 11:54:23,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:54:23,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 11:54:23,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:54:30,453 WARN L222 SmtUtils]: Spent 6.18s 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-28 11:54:33,322 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-01-28 11:54:33,323 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-01-28 11:54:33,323 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-28 11:54:33,325 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-01-28 11:54:33,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-01-28 11:54:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-28 11:54:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-28 11:54:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-01-28 11:54:33,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-01-28 11:54:33,331 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-01-28 11:54:33,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-01-28 11:54:33,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:54:33,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-01-28 11:54:33,335 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-28 11:54:33,344 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-28 11:54:33,345 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-28 11:54:33,345 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-01-28 11:54:33,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-01-28 11:54:33,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 11:54:33,349 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-01-28 11:54:33,349 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-28 11:54:33,351 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-01-28 11:54:33,351 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-01-28 11:54:33,352 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-28 11:54:33,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:54:33,352 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-28 11:54:33,364 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-28 11:54:33,563 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-28 11:54:33,563 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-28 11:54:33,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:54:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-01-28 11:54:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:54:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441573544] [2023-01-28 11:54:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:54:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:54:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:54:34,457 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-28 11:54:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:54:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441573544] [2023-01-28 11:54:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441573544] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:54:34,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267407730] [2023-01-28 11:54:34,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:54:34,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:54:34,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:54:34,459 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-28 11:54:34,459 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-28 11:54:34,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:54:34,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:54:34,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-01-28 11:54:34,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:54:34,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:34,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:34,566 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 11:54:34,567 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-28 11:54:34,625 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-28 11:54:34,683 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:54:34,683 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-28 11:54:34,771 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-28 11:54:34,843 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-28 11:54:34,911 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-28 11:54:35,287 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-28 11:54:35,343 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-28 11:54:35,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:54:36,531 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 11:54:36,531 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-28 11:54:36,584 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-01-28 11:54:36,585 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-28 11:54:36,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:36,617 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-28 11:54:36,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:36,654 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-28 11:54:39,521 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-28 11:54:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267407730] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:54:39,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:54:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-28 11:54:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416066565] [2023-01-28 11:54:39,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:54:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 11:54:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:54:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 11:54:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1164, Unknown=5, NotChecked=0, Total=1332 [2023-01-28 11:54:39,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 11:54:39,526 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-28 11:54:39,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:54:39,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 11:54:39,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:54:40,461 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-28 11:54:50,877 INFO L130 PetriNetUnfolder]: 515/953 cut-off events. [2023-01-28 11:54:50,878 INFO L131 PetriNetUnfolder]: For 2939/2939 co-relation queries the response was YES. [2023-01-28 11:54:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 953 events. 515/953 cut-off events. For 2939/2939 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4713 event pairs, 24 based on Foata normal form. 9/954 useless extension candidates. Maximal degree in co-relation 3410. Up to 302 conditions per place. [2023-01-28 11:54:50,883 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 108 selfloop transitions, 188 changer transitions 15/311 dead transitions. [2023-01-28 11:54:50,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 311 transitions, 2806 flow [2023-01-28 11:54:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-01-28 11:54:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-01-28 11:54:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 4372 transitions. [2023-01-28 11:54:50,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24697774262795164 [2023-01-28 11:54:50,893 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 4372 transitions. [2023-01-28 11:54:50,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 4372 transitions. [2023-01-28 11:54:50,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:54:50,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 4372 transitions. [2023-01-28 11:54:50,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 82.49056603773585) internal successors, (4372), 53 states have internal predecessors, (4372), 0 states have call successors, (0), 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-28 11:54:50,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 334.0) internal successors, (18036), 54 states have internal predecessors, (18036), 0 states have call successors, (0), 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-28 11:54:50,916 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 334.0) internal successors, (18036), 54 states have internal predecessors, (18036), 0 states have call successors, (0), 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-28 11:54:50,916 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 53 states and 4372 transitions. [2023-01-28 11:54:50,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 311 transitions, 2806 flow [2023-01-28 11:54:50,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 311 transitions, 2483 flow, removed 142 selfloop flow, removed 4 redundant places. [2023-01-28 11:54:50,936 INFO L231 Difference]: Finished difference. Result has 133 places, 210 transitions, 2129 flow [2023-01-28 11:54:50,937 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=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=2129, PETRI_PLACES=133, PETRI_TRANSITIONS=210} [2023-01-28 11:54:50,937 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 111 predicate places. [2023-01-28 11:54:50,938 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 210 transitions, 2129 flow [2023-01-28 11:54:50,938 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-28 11:54:50,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:54:50,939 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-28 11:54:50,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 11:54:51,143 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-28 11:54:51,146 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-28 11:54:51,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:54:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1006915981, now seen corresponding path program 4 times [2023-01-28 11:54:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:54:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300851535] [2023-01-28 11:54:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:54:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:54:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:54:51,973 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-28 11:54:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:54:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300851535] [2023-01-28 11:54:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300851535] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:54:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803208446] [2023-01-28 11:54:51,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:54:51,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:54:51,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:54:51,975 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-28 11:54:51,992 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-28 11:54:52,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:54:52,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:54:52,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjunts are in the unsatisfiable core [2023-01-28 11:54:52,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:54:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:52,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-28 11:54:52,114 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 16 [2023-01-28 11:54:52,167 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-28 11:54:52,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:52,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:52,257 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-01-28 11:54:52,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 11:54:52,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-28 11:54:52,376 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-28 11:54:52,437 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-28 11:54:52,696 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 60 treesize of output 20 [2023-01-28 11:54:52,756 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-28 11:54:52,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:54:58,017 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 11:54:58,017 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 267 treesize of output 129 [2023-01-28 11:54:58,110 INFO L321 Elim1Store]: treesize reduction 65, result has 55.8 percent of original size [2023-01-28 11:54:58,110 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 2265 treesize of output 2034 [2023-01-28 11:54:58,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:58,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:58,202 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 529 treesize of output 503 [2023-01-28 11:54:58,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:54:58,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:54:58,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 3 new quantified variables, introduced 5 case distinctions, treesize of input 474 treesize of output 382 [2023-01-28 11:55:03,497 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-28 11:55:03,497 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 217 treesize of output 115 [2023-01-28 11:55:03,565 INFO L321 Elim1Store]: treesize reduction 66, result has 55.1 percent of original size [2023-01-28 11:55:03,568 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 485 treesize of output 509 [2023-01-28 11:55:03,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:55:03,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:55:03,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:03,628 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 192 treesize of output 200 [2023-01-28 11:55:03,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:55:03,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:55:03,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:03,661 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 206 treesize of output 190 [2023-01-28 11:55:05,010 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-28 11:55:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803208446] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:55:05,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:55:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-01-28 11:55:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253533764] [2023-01-28 11:55:05,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:55:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 11:55:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:55:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 11:55:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=956, Unknown=2, NotChecked=0, Total=1122 [2023-01-28 11:55:05,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-28 11:55:05,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 210 transitions, 2129 flow. Second operand has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 0 states have call successors, (0), 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-28 11:55:05,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:55:05,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-28 11:55:05,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:55:12,505 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-28 11:55:15,043 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-28 11:55:28,395 WARN L222 SmtUtils]: Spent 11.62s on a formula simplification. DAG size of input: 172 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 11:55:35,267 INFO L130 PetriNetUnfolder]: 721/1326 cut-off events. [2023-01-28 11:55:35,267 INFO L131 PetriNetUnfolder]: For 6163/6163 co-relation queries the response was YES. [2023-01-28 11:55:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7101 conditions, 1326 events. 721/1326 cut-off events. For 6163/6163 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7102 event pairs, 18 based on Foata normal form. 6/1330 useless extension candidates. Maximal degree in co-relation 7016. Up to 373 conditions per place. [2023-01-28 11:55:35,278 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 123 selfloop transitions, 237 changer transitions 8/368 dead transitions. [2023-01-28 11:55:35,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 368 transitions, 4039 flow [2023-01-28 11:55:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-28 11:55:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-01-28 11:55:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3608 transitions. [2023-01-28 11:55:35,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.251218493246066 [2023-01-28 11:55:35,284 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3608 transitions. [2023-01-28 11:55:35,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3608 transitions. [2023-01-28 11:55:35,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:55:35,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3608 transitions. [2023-01-28 11:55:35,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 83.90697674418605) internal successors, (3608), 43 states have internal predecessors, (3608), 0 states have call successors, (0), 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-28 11:55:35,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 0 states have call successors, (0), 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-28 11:55:35,311 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 0 states have call successors, (0), 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-28 11:55:35,311 INFO L175 Difference]: Start difference. First operand has 133 places, 210 transitions, 2129 flow. Second operand 43 states and 3608 transitions. [2023-01-28 11:55:35,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 368 transitions, 4039 flow [2023-01-28 11:55:35,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 368 transitions, 3630 flow, removed 169 selfloop flow, removed 15 redundant places. [2023-01-28 11:55:35,351 INFO L231 Difference]: Finished difference. Result has 161 places, 278 transitions, 3008 flow [2023-01-28 11:55:35,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3008, PETRI_PLACES=161, PETRI_TRANSITIONS=278} [2023-01-28 11:55:35,352 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 139 predicate places. [2023-01-28 11:55:35,352 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 278 transitions, 3008 flow [2023-01-28 11:55:35,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 0 states have call successors, (0), 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-28 11:55:35,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:55:35,352 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-28 11:55:35,373 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-28 11:55:35,557 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-28 11:55:35,557 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-28 11:55:35,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:55:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 5 times [2023-01-28 11:55:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:55:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298173059] [2023-01-28 11:55:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:55:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:55:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:55:36,341 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-28 11:55:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:55:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298173059] [2023-01-28 11:55:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298173059] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:55:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860954913] [2023-01-28 11:55:36,342 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:55:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:55:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:55:36,365 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-28 11:55:36,367 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-28 11:55:36,444 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:55:36,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:55:36,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 68 conjunts are in the unsatisfiable core [2023-01-28 11:55:36,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:55:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:55:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:55:36,474 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 11:55:36,475 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-28 11:55:36,523 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-28 11:55:36,602 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:55:36,602 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-28 11:55:36,655 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-28 11:55:36,713 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-28 11:55:36,761 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-28 11:55:37,039 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-01-28 11:55:37,039 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-28 11:55:37,098 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-28 11:55:37,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:55:38,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:38,329 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 158 treesize of output 110 [2023-01-28 11:55:38,414 INFO L321 Elim1Store]: treesize reduction 4, result has 95.3 percent of original size [2023-01-28 11:55:38,415 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 54615 treesize of output 50999 [2023-01-28 11:55:38,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:38,804 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 1849 treesize of output 1729 [2023-01-28 11:55:38,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:38,874 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 1657 treesize of output 1633 [2023-01-28 11:55:38,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:55:38,961 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 1584 treesize of output 1272 [2023-01-28 11:59:31,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:59:31,501 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 129 treesize of output 93 [2023-01-28 11:59:31,560 INFO L321 Elim1Store]: treesize reduction 4, result has 95.3 percent of original size [2023-01-28 11:59:31,560 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 2787 treesize of output 2727 [2023-01-28 11:59:31,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:59:31,634 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 410 treesize of output 462 [2023-01-28 11:59:31,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:59:31,679 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 457 treesize of output 489 [2023-01-28 11:59:31,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:59:31,728 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 440 treesize of output 432 [2023-01-28 12:01:17,212 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-28 12:01:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860954913] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:01:17,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:01:17,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-01-28 12:01:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455099408] [2023-01-28 12:01:17,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:01:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 12:01:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:01:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 12:01:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=955, Unknown=7, NotChecked=0, Total=1122 [2023-01-28 12:01:17,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-01-28 12:01:17,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 278 transitions, 3008 flow. Second operand has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 0 states have call successors, (0), 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-28 12:01:17,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:01:17,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-01-28 12:01:17,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:01:40,740 WARN L222 SmtUtils]: Spent 18.39s on a formula simplification. DAG size of input: 201 DAG size of output: 174 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 12:01:49,609 INFO L130 PetriNetUnfolder]: 919/1697 cut-off events. [2023-01-28 12:01:49,609 INFO L131 PetriNetUnfolder]: For 7388/7388 co-relation queries the response was YES. [2023-01-28 12:01:49,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9255 conditions, 1697 events. 919/1697 cut-off events. For 7388/7388 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9494 event pairs, 26 based on Foata normal form. 10/1705 useless extension candidates. Maximal degree in co-relation 9081. Up to 636 conditions per place. [2023-01-28 12:01:49,621 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 131 selfloop transitions, 288 changer transitions 5/424 dead transitions. [2023-01-28 12:01:49,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 424 transitions, 5029 flow [2023-01-28 12:01:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-28 12:01:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-01-28 12:01:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3418 transitions. [2023-01-28 12:01:49,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2495983642471155 [2023-01-28 12:01:49,625 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3418 transitions. [2023-01-28 12:01:49,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3418 transitions. [2023-01-28 12:01:49,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:01:49,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3418 transitions. [2023-01-28 12:01:49,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 83.36585365853658) internal successors, (3418), 41 states have internal predecessors, (3418), 0 states have call successors, (0), 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-28 12:01:49,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 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-28 12:01:49,642 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 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-28 12:01:49,642 INFO L175 Difference]: Start difference. First operand has 161 places, 278 transitions, 3008 flow. Second operand 41 states and 3418 transitions. [2023-01-28 12:01:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 424 transitions, 5029 flow [2023-01-28 12:01:49,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 424 transitions, 4585 flow, removed 144 selfloop flow, removed 18 redundant places. [2023-01-28 12:01:49,690 INFO L231 Difference]: Finished difference. Result has 192 places, 351 transitions, 4389 flow [2023-01-28 12:01:49,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2638, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=4389, PETRI_PLACES=192, PETRI_TRANSITIONS=351} [2023-01-28 12:01:49,690 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 170 predicate places. [2023-01-28 12:01:49,690 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 351 transitions, 4389 flow [2023-01-28 12:01:49,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 80.55882352941177) internal successors, (2739), 34 states have internal predecessors, (2739), 0 states have call successors, (0), 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-28 12:01:49,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:01:49,691 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-28 12:01:49,707 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-28 12:01:49,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:01:49,897 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-28 12:01:49,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:01:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2104011777, now seen corresponding path program 6 times [2023-01-28 12:01:49,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:01:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048886668] [2023-01-28 12:01:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:01:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:01:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:01:50,780 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-28 12:01:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:01:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048886668] [2023-01-28 12:01:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048886668] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:01:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131142936] [2023-01-28 12:01:50,780 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 12:01:50,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:01:50,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:01:50,781 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-28 12:01:50,806 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-28 12:01:50,872 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-28 12:01:50,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 12:01:50,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 63 conjunts are in the unsatisfiable core [2023-01-28 12:01:50,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:01:51,025 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-28 12:01:51,083 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-28 12:01:51,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:01:51,205 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-28 12:01:51,445 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-01-28 12:01:51,446 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-28 12:01:51,475 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-28 12:01:51,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:01:51,722 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (let ((.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (<= (select .cse0 .cse1) (select (select .cse2 c_~q2~0.base) .cse3)) (not (= (select .cse0 .cse4) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= (select .cse5 .cse4) c_~j~0)) (< (select (select .cse6 c_~q2~0.base) .cse3) (+ (select .cse5 .cse1) 1)))))))) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0)) is different from false [2023-01-28 12:01:52,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:01:52,045 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 115 treesize of output 79 [2023-01-28 12:01:52,107 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 12:01:52,107 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 1968 treesize of output 1776 [2023-01-28 12:01:52,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:01:52,164 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 438 treesize of output 370 [2023-01-28 12:01:52,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:01:52,208 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 354 treesize of output 374 [2023-01-28 12:02:12,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:12,537 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2023-01-28 12:02:12,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 12:02:12,567 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-01-28 12:02:12,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 600 treesize of output 503 [2023-01-28 12:02:12,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:12,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 182 [2023-01-28 12:02:12,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:12,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:12,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:12,608 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 206 treesize of output 174 [2023-01-28 12:02:12,892 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-28 12:02:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131142936] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:02:12,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:02:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-01-28 12:02:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610078967] [2023-01-28 12:02:12,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:02:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 12:02:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:02:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 12:02:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=886, Unknown=1, NotChecked=60, Total=1056 [2023-01-28 12:02:12,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 12:02:12,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 351 transitions, 4389 flow. Second operand has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 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-28 12:02:12,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:02:12,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 12:02:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:02:12,952 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (< c_~q2_back~0 0)) (.cse3 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse5 (<= c_~n2~0 c_~q2_front~0)) (.cse6 (< c_~q2_front~0 0)) (.cse0 (= c_~i~0 0)) (.cse7 (= c_~q1_back~0 c_~q1_front~0)) (.cse15 (= c_~j~0 0))) (and (<= c_~q2_back~0 c_~q2_front~0) .cse0 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (or .cse1 .cse2 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5 .cse6 (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (= c_~q2_front~0 c_~q2_back~0) .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (or .cse1 .cse2 (let ((.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse11 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse8 (select .cse10 ~q1~0.base))) (or (<= (select .cse8 .cse9) (select (select .cse10 c_~q2~0.base) .cse11)) (not (= (select .cse8 .cse12) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse13 (select .cse14 ~q1~0.base))) (or (not (= (select .cse13 .cse12) c_~j~0)) (< (select (select .cse14 c_~q2~0.base) .cse11) (+ (select .cse13 .cse9) 1)))))))) .cse3 .cse4 .cse5 .cse6 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or (<= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (and .cse0 (or (= c_~q2_front~0 0) (not (= c_~q2_back~0 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse7 .cse15)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse7 (<= c_~n1~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse15)) is different from false [2023-01-28 12:02:13,933 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~i~0 c_~j~0) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (let ((.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (<= (select .cse0 .cse1) (select (select .cse2 c_~q2~0.base) .cse3)) (not (= (select .cse0 .cse4) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= (select .cse5 .cse4) c_~j~0)) (< (select (select .cse6 c_~q2~0.base) .cse3) (+ (select .cse5 .cse1) 1)))))))) (<= 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))))) (< c_~j~0 (+ c_~i~0 1))) is different from false [2023-01-28 12:02:13,952 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (< c_~q1_back~0 0)) (.cse3 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse1 (< 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|) .cse2 .cse3 (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0))) (or .cse0 .cse1 (let ((.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse4 (select .cse6 ~q1~0.base))) (or (<= (select .cse4 .cse5) (select (select .cse6 c_~q2~0.base) .cse7)) (not (= (select .cse4 .cse8) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (not (= (select .cse9 .cse8) c_~j~0)) (< (select (select .cse10 c_~q2~0.base) .cse7) (+ (select .cse9 .cse5) 1)))))))) (<= c_~n2~0 c_~q2_back~0) .cse2 (<= c_~n2~0 c_~q2_front~0) .cse3 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (< c_~j~0 (+ c_~i~0 1)))) is different from false [2023-01-28 12:02:14,205 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse4 (let ((.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse6 (select .cse8 ~q1~0.base))) (or (<= (select .cse6 .cse7) (select (select .cse8 c_~q2~0.base) .cse9)) (not (= (select .cse6 .cse10) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse11 (select .cse12 ~q1~0.base))) (or (not (= (select .cse11 .cse10) c_~j~0)) (< (select (select .cse12 c_~q2~0.base) .cse9) (+ (select .cse11 .cse7) 1))))))))) (.cse2 (< c_~q1_back~0 0)) (.cse5 (<= c_~n2~0 c_~q2_front~0)) (.cse3 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (< 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|) .cse2 .cse3 (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0))) (or .cse0 .cse4 .cse2 .cse5 .cse3) (or .cse0 .cse1 .cse4 (<= c_~n2~0 c_~q2_back~0) .cse2 .cse5 .cse3 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))))) is different from false [2023-01-28 12:02:15,963 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse11 (< c_~q2_back~0 0)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (< c_~q1_back~0 0)) (.cse2 (<= c_~n2~0 c_~q2_front~0)) (.cse3 (< c_~q2_front~0 0)) (.cse9 (select |c_#memory_int| c_~q2~0.base))) (and (or .cse0 .cse1 .cse2 .cse3 (let ((.cse4 (select .cse9 .cse10))) (and (forall ((~q1~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~q1~0.base))) (or (< .cse4 (+ (select .cse5 .cse6) 1)) (not (= c_~j~0 (select .cse5 .cse7)))))) (forall ((~q1~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~q1~0.base))) (or (not (= c_~j~0 (select .cse8 .cse7))) (<= (select .cse8 .cse6) .cse4))))))) (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 .cse11 (< 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|) .cse1 .cse3 (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0))) (or .cse0 .cse11 (and (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse12 (select .cse13 ~q1~0.base))) (or (<= (select .cse12 .cse6) (select (select .cse13 c_~q2~0.base) .cse10)) (not (= (select .cse12 .cse7) c_~j~0)))))) (forall ((v_ArrVal_336 (Array Int Int)) (~q1~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_336))) (let ((.cse14 (select .cse15 ~q1~0.base))) (or (not (= (select .cse14 .cse7) c_~j~0)) (< (select (select .cse15 c_~q2~0.base) .cse10) (+ (select .cse14 .cse6) 1))))))) (<= c_~n2~0 c_~q2_back~0) .cse1 .cse2 .cse3 (not (= c_~i~0 (select .cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (< c_~j~0 (+ c_~i~0 1)))) is different from false [2023-01-28 12:02:18,631 INFO L130 PetriNetUnfolder]: 1010/1902 cut-off events. [2023-01-28 12:02:18,631 INFO L131 PetriNetUnfolder]: For 12485/12485 co-relation queries the response was YES. [2023-01-28 12:02:18,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11626 conditions, 1902 events. 1010/1902 cut-off events. For 12485/12485 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11358 event pairs, 112 based on Foata normal form. 45/1945 useless extension candidates. Maximal degree in co-relation 11325. Up to 1020 conditions per place. [2023-01-28 12:02:18,661 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 195 selfloop transitions, 186 changer transitions 76/457 dead transitions. [2023-01-28 12:02:18,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 457 transitions, 6172 flow [2023-01-28 12:02:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 12:02:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 12:02:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3250 transitions. [2023-01-28 12:02:18,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25606681374093915 [2023-01-28 12:02:18,665 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3250 transitions. [2023-01-28 12:02:18,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3250 transitions. [2023-01-28 12:02:18,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:02:18,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3250 transitions. [2023-01-28 12:02:18,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.52631578947368) internal successors, (3250), 38 states have internal predecessors, (3250), 0 states have call successors, (0), 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-28 12:02:18,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-28 12:02:18,689 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-28 12:02:18,689 INFO L175 Difference]: Start difference. First operand has 192 places, 351 transitions, 4389 flow. Second operand 38 states and 3250 transitions. [2023-01-28 12:02:18,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 457 transitions, 6172 flow [2023-01-28 12:02:18,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 457 transitions, 5876 flow, removed 85 selfloop flow, removed 21 redundant places. [2023-01-28 12:02:18,786 INFO L231 Difference]: Finished difference. Result has 222 places, 339 transitions, 4637 flow [2023-01-28 12:02:18,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=4637, PETRI_PLACES=222, PETRI_TRANSITIONS=339} [2023-01-28 12:02:18,787 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 200 predicate places. [2023-01-28 12:02:18,787 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 339 transitions, 4637 flow [2023-01-28 12:02:18,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 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-28 12:02:18,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:02:18,788 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-28 12:02:18,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 12:02:18,992 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,SelfDestructingSolverStorable11 [2023-01-28 12:02:18,993 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-28 12:02:18,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:02:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 130363839, now seen corresponding path program 7 times [2023-01-28 12:02:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:02:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737277213] [2023-01-28 12:02:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:02:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:02:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:02:19,970 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-28 12:02:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:02:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737277213] [2023-01-28 12:02:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737277213] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:02:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964899575] [2023-01-28 12:02:19,971 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 12:02:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:02:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:02:19,972 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-28 12:02:19,992 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-28 12:02:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:02:20,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 68 conjunts are in the unsatisfiable core [2023-01-28 12:02:20,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:02:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:20,087 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 12:02:20,087 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-28 12:02:20,151 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-28 12:02:20,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:02:20,212 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-28 12:02:20,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 12:02:20,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 12:02:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 12:02:20,434 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 25 treesize of output 25 [2023-01-28 12:02:20,679 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-28 12:02:20,741 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-28 12:02:20,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:02:21,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:21,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-01-28 12:02:21,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:21,738 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 795 treesize of output 771 [2023-01-28 12:02:21,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:21,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 330 [2023-01-28 12:02:21,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:21,835 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 331 treesize of output 371 [2023-01-28 12:02:21,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:21,869 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 288 treesize of output 268 [2023-01-28 12:02:36,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:36,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-01-28 12:02:36,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:36,944 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 779 treesize of output 755 [2023-01-28 12:02:36,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:37,000 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 274 treesize of output 326 [2023-01-28 12:02:37,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:37,045 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 319 treesize of output 359 [2023-01-28 12:02:37,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:02:37,079 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 276 treesize of output 256 [2023-01-28 12:02:53,431 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-28 12:02:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964899575] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:02:53,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:02:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-28 12:02:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053183780] [2023-01-28 12:02:53,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:02:53,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 12:02:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:02:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 12:02:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1195, Unknown=2, NotChecked=0, Total=1332 [2023-01-28 12:02:53,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 12:02:53,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 339 transitions, 4637 flow. Second operand has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 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-28 12:02:53,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:02:53,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 12:02:53,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:02:54,905 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse27 (* c_~q2_back~0 4)) (.cse7 (select |c_#memory_int| c_~q2~0.base)) (.cse26 (* c_~q2_front~0 4))) (let ((.cse9 (<= c_~n1~0 1)) (.cse8 (select .cse7 .cse26)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse15 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~i~0 1)) (.cse17 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse12 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (<= c_~n2~0 c_~q2_back~0)) (.cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse3 (< c_~q1_back~0 0)) (.cse6 (= c_~q1_back~0 c_~q1_front~0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (< 0 (+ c_~q2_front~0 1)) (or .cse0 .cse1 (< 0 c_~q2_back~0) .cse2 .cse3 (let ((.cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|) 0))))) (and (or .cse4 (= c_~q2_front~0 c_~q2_back~0) (not (= c_~j~0 c_~i~0))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (< c_~j~0 c_~i~0)) (or (and (< c_~j~0 .cse5) .cse6) .cse4)))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (<= c_~q2_front~0 0) (= 0 (select .cse7 0)) (<= 1 c_~N~0) (<= 0 .cse8) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~j~0 c_~i~0) .cse9 (or (and (= c_~q1_front~0 0) (= c_~j~0 0)) (not (= c_~q1_back~0 0))) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 .cse3 (and (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse16 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse13 (select .cse16 c_~q1~0.base))) (or (not (= (select .cse13 .cse14) c_~j~0)) (< (select .cse13 .cse15) c_~i~0) (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) .cse5)))))))) (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse20 (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse19 (select .cse20 c_~q1~0.base))) (or (not (= (select .cse19 .cse14) c_~j~0)) (< (select .cse19 .cse15) .cse5) (< (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) c_~i~0)))))))))) (< c_~i~0 (+ c_~j~0 1)) (or .cse9 (<= c_~q1_back~0 0)) (< .cse8 c_~N~0) (or (let ((.cse22 (+ c_~q2~0.offset .cse26))) (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse23 (select .cse21 c_~q1~0.base))) (or (< (select (select .cse21 c_~q2~0.base) .cse22) c_~i~0) (not (= (select .cse23 .cse14) c_~j~0)) (< (select .cse23 .cse15) .cse5))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse24 (select .cse25 c_~q1~0.base))) (or (not (= (select .cse24 .cse14) c_~j~0)) (< (select .cse24 .cse15) c_~i~0) (< (select (select .cse25 c_~q2~0.base) .cse22) .cse5))))))) .cse0 .cse1 .cse10 .cse3 (not (= c_~i~0 (select .cse7 (+ .cse27 c_~q2~0.offset))))) (<= 0 c_~q2_front~0) (or .cse0 .cse1 (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse29 (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse30 (select .cse29 c_~q1~0.base))) (or (< (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) .cse5) (< (select .cse30 .cse15) c_~i~0) (not (= c_~j~0 (select .cse30 .cse14)))))))))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse31 (select .cse32 c_~q1~0.base))) (or (< (select .cse31 .cse15) .cse5) (< (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) c_~i~0) (not (= c_~j~0 (select .cse31 .cse14))))))) (not (= (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse12) c_~i~0)))))) .cse10 .cse2 .cse3) (<= c_~j~0 0) .cse6 (<= (+ 2 c_~q1~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2023-01-28 12:02:58,203 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| c_~q2~0.base)) (.cse30 (* c_~q2_back~0 4)) (.cse31 (* c_~q1_front~0 4)) (.cse38 (* c_~q2_front~0 4))) (let ((.cse12 (+ c_~q2~0.offset .cse38)) (.cse7 (select |c_#memory_int| c_~q1~0.base)) (.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (< c_~q2_back~0 0)) (.cse8 (+ .cse31 c_~q1~0.offset)) (.cse6 (+ c_~i~0 1)) (.cse21 (+ .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse18 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (<= c_~n2~0 c_~q2_back~0)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (< c_~q1_back~0 0)) (.cse15 (select .cse29 .cse38))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (exists ((~q2~0.base Int) (v_~q2_front~0_79 Int)) (let ((.cse0 (select (select |c_#memory_int| ~q2~0.base) (* 4 v_~q2_front~0_79)))) (and (<= c_~j~0 (+ 1 .cse0)) (<= 0 .cse0) (< .cse0 c_~N~0) (<= v_~q2_front~0_79 0) (<= 0 v_~q2_front~0_79) (not (= c_~q1~0.base ~q2~0.base))))) (or .cse1 .cse2 (< 0 c_~q2_back~0) .cse3 .cse4 (let ((.cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|) 0))))) (and (or .cse5 (= c_~q2_front~0 c_~q2_back~0) (not (= c_~j~0 c_~i~0))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (< c_~j~0 c_~i~0)) (or (and (< c_~j~0 .cse6) (= c_~q1_back~0 c_~q1_front~0)) .cse5)))) (<= (select .cse7 .cse8) 0) (<= 0 c_~q1_front~0) (<= c_~q2_front~0 0) (or .cse1 .cse4 (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse9 (select .cse11 c_~q1~0.base))) (or (not (= (select .cse9 .cse10) c_~j~0)) (< (select .cse9 .cse8) c_~N~0) (< (+ (select (select .cse11 c_~q2~0.base) .cse12) 1) c_~N~0))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse14 (select .cse13 c_~q1~0.base))) (or (< (select (select .cse13 c_~q2~0.base) .cse12) c_~N~0) (not (= (select .cse14 .cse10) c_~j~0)) (< (+ (select .cse14 .cse8) 1) c_~N~0))))))) (<= 1 c_~N~0) (<= 0 .cse15) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~j~0 c_~N~0) (or .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse4 (and (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse20 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse19 (select .cse20 c_~q1~0.base))) (or (not (= (select .cse19 .cse10) c_~j~0)) (< (select .cse19 .cse8) c_~i~0) (< (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) .cse6)))))))) (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse24 (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse23 (select .cse24 c_~q1~0.base))) (or (not (= (select .cse23 .cse10) c_~j~0)) (< (select .cse23 .cse8) .cse6) (< (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) c_~i~0)))))))))) (< .cse15 c_~N~0) (or (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (or (< (select (select .cse25 c_~q2~0.base) .cse12) c_~i~0) (not (= (select .cse26 .cse10) c_~j~0)) (< (select .cse26 .cse8) .cse6))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse27 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse27 .cse10) c_~j~0)) (< (select .cse27 .cse8) c_~i~0) (< (select (select .cse28 c_~q2~0.base) .cse12) .cse6)))))) .cse1 .cse2 .cse16 .cse4 (not (= c_~i~0 (select .cse29 (+ .cse30 c_~q2~0.offset))))) (<= 0 c_~q2_front~0) (= (select .cse7 .cse31) 0) (or .cse1 .cse2 (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse33 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse34 (select .cse33 c_~q1~0.base))) (or (< (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) .cse6) (< (select .cse34 .cse8) c_~i~0) (not (= c_~j~0 (select .cse34 .cse10)))))))))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse35 (select .cse36 c_~q1~0.base))) (or (< (select .cse35 .cse8) .cse6) (< (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) c_~i~0) (not (= c_~j~0 (select .cse35 .cse10))))))) (not (= (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) c_~i~0)))))) .cse16 .cse3 .cse4) (= .cse15 0) (<= c_~q1_front~0 0)))) is different from false [2023-01-28 12:02:58,364 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~q2_back~0 4)) (.cse23 (* c_~q2_front~0 4))) (let ((.cse6 (select |c_#memory_int| c_~q2~0.base)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse12 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~i~0 1)) (.cse14 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (<= c_~n2~0 c_~q2_back~0)) (.cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse3 (< c_~q1_back~0 0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (< 0 (+ c_~q2_front~0 1)) (or .cse0 .cse1 (< 0 c_~q2_back~0) .cse2 .cse3 (let ((.cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|) 0))))) (and (or .cse4 (= c_~q2_front~0 c_~q2_back~0) (not (= c_~j~0 c_~i~0))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (< c_~j~0 c_~i~0)) (or (and (< c_~j~0 .cse5) (= c_~q1_back~0 c_~q1_front~0)) .cse4)))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (<= c_~q2_front~0 0) (= 0 (select .cse6 0)) (<= 1 c_~N~0) (or (and (= c_~q1_front~0 0) (= c_~j~0 0)) (not (= c_~q1_back~0 0))) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse3 (and (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse13 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse10 (select .cse13 c_~q1~0.base))) (or (not (= (select .cse10 .cse11) c_~j~0)) (< (select .cse10 .cse12) c_~i~0) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) .cse5)))))))) (forall ((v_ArrVal_381 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse17 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse16 (select .cse17 c_~q1~0.base))) (or (not (= (select .cse16 .cse11) c_~j~0)) (< (select .cse16 .cse12) .cse5) (< (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) c_~i~0)))))))))) (or (<= c_~n1~0 1) (<= c_~q1_back~0 0)) (or (let ((.cse19 (+ c_~q2~0.offset .cse23))) (and (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse20 (select .cse18 c_~q1~0.base))) (or (< (select (select .cse18 c_~q2~0.base) .cse19) c_~i~0) (not (= (select .cse20 .cse11) c_~j~0)) (< (select .cse20 .cse12) .cse5))))) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse21 (select .cse22 c_~q1~0.base))) (or (not (= (select .cse21 .cse11) c_~j~0)) (< (select .cse21 .cse12) c_~i~0) (< (select (select .cse22 c_~q2~0.base) .cse19) .cse5))))))) .cse0 .cse1 .cse7 .cse3 (not (= c_~i~0 (select .cse6 (+ .cse24 c_~q2~0.offset))))) (or .cse0 .cse1 (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (not (= (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9) c_~i~0)) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse26 (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse27 (select .cse26 c_~q1~0.base))) (or (< (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) .cse5) (< (select .cse27 .cse12) c_~i~0) (not (= c_~j~0 (select .cse27 .cse11)))))))))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_381))) (or (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_382))) (let ((.cse28 (select .cse29 c_~q1~0.base))) (or (< (select .cse28 .cse12) .cse5) (< (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) c_~i~0) (not (= c_~j~0 (select .cse28 .cse11))))))) (not (= (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse9) c_~i~0)))))) .cse7 .cse2 .cse3)))) is different from false [2023-01-28 12:03:00,139 INFO L130 PetriNetUnfolder]: 880/1684 cut-off events. [2023-01-28 12:03:00,140 INFO L131 PetriNetUnfolder]: For 12154/12154 co-relation queries the response was YES. [2023-01-28 12:03:00,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11220 conditions, 1684 events. 880/1684 cut-off events. For 12154/12154 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9762 event pairs, 36 based on Foata normal form. 2/1684 useless extension candidates. Maximal degree in co-relation 11071. Up to 811 conditions per place. [2023-01-28 12:03:00,154 INFO L137 encePairwiseOnDemand]: 319/334 looper letters, 117 selfloop transitions, 300 changer transitions 14/431 dead transitions. [2023-01-28 12:03:00,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 431 transitions, 6265 flow [2023-01-28 12:03:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-28 12:03:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-28 12:03:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3440 transitions. [2023-01-28 12:03:00,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2452238380382093 [2023-01-28 12:03:00,158 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3440 transitions. [2023-01-28 12:03:00,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3440 transitions. [2023-01-28 12:03:00,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:03:00,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3440 transitions. [2023-01-28 12:03:00,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 81.9047619047619) internal successors, (3440), 42 states have internal predecessors, (3440), 0 states have call successors, (0), 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-28 12:03:00,174 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-28 12:03:00,175 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-28 12:03:00,175 INFO L175 Difference]: Start difference. First operand has 222 places, 339 transitions, 4637 flow. Second operand 42 states and 3440 transitions. [2023-01-28 12:03:00,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 431 transitions, 6265 flow [2023-01-28 12:03:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 431 transitions, 6090 flow, removed 53 selfloop flow, removed 19 redundant places. [2023-01-28 12:03:00,252 INFO L231 Difference]: Finished difference. Result has 240 places, 364 transitions, 5750 flow [2023-01-28 12:03:00,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=4524, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=5750, PETRI_PLACES=240, PETRI_TRANSITIONS=364} [2023-01-28 12:03:00,253 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 218 predicate places. [2023-01-28 12:03:00,253 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 364 transitions, 5750 flow [2023-01-28 12:03:00,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 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-28 12:03:00,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:03:00,254 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-28 12:03:00,259 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-28 12:03:00,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:03:00,459 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-28 12:03:00,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:03:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 103847501, now seen corresponding path program 8 times [2023-01-28 12:03:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:03:00,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773373920] [2023-01-28 12:03:00,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:03:00,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:03:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:03:01,231 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-28 12:03:01,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:03:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773373920] [2023-01-28 12:03:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773373920] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:03:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493253780] [2023-01-28 12:03:01,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 12:03:01,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:03:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:03:01,238 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-28 12:03:01,240 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-28 12:03:01,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 12:03:01,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 12:03:01,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2023-01-28 12:03:01,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:03:01,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:03:01,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:03:01,356 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 12:03:01,356 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-28 12:03:01,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 12:03:01,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 12:03:01,495 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-28 12:03:01,567 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-28 12:03:01,631 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-28 12:03:01,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:03:01,743 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-28 12:03:01,902 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-28 12:03:01,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:03:02,727 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 12:03:02,727 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-28 12:03:02,833 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-28 12:03:02,834 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 1734 treesize of output 1610 [2023-01-28 12:03:03,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:03,129 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 404 treesize of output 426 [2023-01-28 12:03:03,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:03,200 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 336 treesize of output 280 [2023-01-28 12:03:20,489 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 12:03:20,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 97 [2023-01-28 12:03:20,619 INFO L321 Elim1Store]: treesize reduction 4, result has 97.0 percent of original size [2023-01-28 12:03:20,619 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 1030 treesize of output 1018 [2023-01-28 12:03:20,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:20,691 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-28 12:03:20,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:20,735 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-28 12:03:30,357 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-28 12:03:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493253780] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:03:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:03:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2023-01-28 12:03:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083475221] [2023-01-28 12:03:30,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:03:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 12:03:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:03:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 12:03:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=863, Unknown=2, NotChecked=0, Total=992 [2023-01-28 12:03:30,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-01-28 12:03:30,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 364 transitions, 5750 flow. Second operand has 32 states, 32 states have (on average 79.65625) internal successors, (2549), 32 states have internal predecessors, (2549), 0 states have call successors, (0), 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-28 12:03:30,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:03:30,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-01-28 12:03:30,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:03:45,961 INFO L130 PetriNetUnfolder]: 1219/2308 cut-off events. [2023-01-28 12:03:45,961 INFO L131 PetriNetUnfolder]: For 27666/27666 co-relation queries the response was YES. [2023-01-28 12:03:45,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18317 conditions, 2308 events. 1219/2308 cut-off events. For 27666/27666 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13905 event pairs, 111 based on Foata normal form. 5/2311 useless extension candidates. Maximal degree in co-relation 18186. Up to 696 conditions per place. [2023-01-28 12:03:45,985 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 184 selfloop transitions, 362 changer transitions 24/570 dead transitions. [2023-01-28 12:03:45,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 570 transitions, 9652 flow [2023-01-28 12:03:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-28 12:03:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-01-28 12:03:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3550 transitions. [2023-01-28 12:03:46,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24718005848767582 [2023-01-28 12:03:46,009 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3550 transitions. [2023-01-28 12:03:46,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3550 transitions. [2023-01-28 12:03:46,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:03:46,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3550 transitions. [2023-01-28 12:03:46,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 82.55813953488372) internal successors, (3550), 43 states have internal predecessors, (3550), 0 states have call successors, (0), 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-28 12:03:46,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 0 states have call successors, (0), 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-28 12:03:46,029 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 334.0) internal successors, (14696), 44 states have internal predecessors, (14696), 0 states have call successors, (0), 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-28 12:03:46,029 INFO L175 Difference]: Start difference. First operand has 240 places, 364 transitions, 5750 flow. Second operand 43 states and 3550 transitions. [2023-01-28 12:03:46,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 570 transitions, 9652 flow [2023-01-28 12:03:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 570 transitions, 9457 flow, removed 53 selfloop flow, removed 16 redundant places. [2023-01-28 12:03:46,254 INFO L231 Difference]: Finished difference. Result has 275 places, 458 transitions, 8243 flow [2023-01-28 12:03:46,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=8243, PETRI_PLACES=275, PETRI_TRANSITIONS=458} [2023-01-28 12:03:46,255 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 253 predicate places. [2023-01-28 12:03:46,255 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 458 transitions, 8243 flow [2023-01-28 12:03:46,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 79.65625) internal successors, (2549), 32 states have internal predecessors, (2549), 0 states have call successors, (0), 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-28 12:03:46,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:03:46,256 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-28 12:03:46,267 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-28 12:03:46,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:03:46,457 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-28 12:03:46,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:03:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1392456859, now seen corresponding path program 9 times [2023-01-28 12:03:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:03:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983573504] [2023-01-28 12:03:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:03:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:03:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:03:47,987 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-28 12:03:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:03:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983573504] [2023-01-28 12:03:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983573504] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:03:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931882935] [2023-01-28 12:03:47,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 12:03:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:03:47,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:03:48,013 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-28 12:03:48,014 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-28 12:03:48,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 12:03:48,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 12:03:48,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-28 12:03:48,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:03:48,378 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-28 12:03:48,432 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-28 12:03:48,485 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-28 12:03:48,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:48,691 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-28 12:03:48,780 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-28 12:03:48,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:03:49,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:49,654 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-28 12:03:49,720 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 12:03:49,721 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-28 12:03:49,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:49,789 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-28 12:03:49,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:03:49,835 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-28 12:04:21,222 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 12:04:21,223 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 1 [2023-01-28 12:04:21,364 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-28 12:04:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931882935] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:04:21,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:04:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 32 [2023-01-28 12:04:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639593248] [2023-01-28 12:04:21,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:04:21,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 12:04:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:04:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 12:04:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1003, Unknown=1, NotChecked=0, Total=1122 [2023-01-28 12:04:21,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-01-28 12:04:21,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 458 transitions, 8243 flow. Second operand has 34 states, 34 states have (on average 82.61764705882354) internal successors, (2809), 34 states have internal predecessors, (2809), 0 states have call successors, (0), 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-28 12:04:21,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:04:21,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-01-28 12:04:21,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:04:48,990 WARN L222 SmtUtils]: Spent 26.73s on a formula simplification. DAG size of input: 186 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 12:05:04,129 WARN L222 SmtUtils]: Spent 10.45s on a formula simplification. DAG size of input: 136 DAG size of output: 112 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 12:05:06,480 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-28 12:05:08,650 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-28 12:05:11,331 INFO L130 PetriNetUnfolder]: 1408/2633 cut-off events. [2023-01-28 12:05:11,331 INFO L131 PetriNetUnfolder]: For 36243/36243 co-relation queries the response was YES. [2023-01-28 12:05:11,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22656 conditions, 2633 events. 1408/2633 cut-off events. For 36243/36243 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16304 event pairs, 88 based on Foata normal form. 2/2633 useless extension candidates. Maximal degree in co-relation 22544. Up to 1087 conditions per place. [2023-01-28 12:05:11,383 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 153 selfloop transitions, 462 changer transitions 4/619 dead transitions. [2023-01-28 12:05:11,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 619 transitions, 11752 flow [2023-01-28 12:05:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 12:05:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 12:05:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3254 transitions. [2023-01-28 12:05:11,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25638197289631265 [2023-01-28 12:05:11,386 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3254 transitions. [2023-01-28 12:05:11,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3254 transitions. [2023-01-28 12:05:11,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:05:11,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3254 transitions. [2023-01-28 12:05:11,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.63157894736842) internal successors, (3254), 38 states have internal predecessors, (3254), 0 states have call successors, (0), 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-28 12:05:11,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-28 12:05:11,412 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-28 12:05:11,412 INFO L175 Difference]: Start difference. First operand has 275 places, 458 transitions, 8243 flow. Second operand 38 states and 3254 transitions. [2023-01-28 12:05:11,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 619 transitions, 11752 flow [2023-01-28 12:05:11,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 619 transitions, 11378 flow, removed 137 selfloop flow, removed 25 redundant places. [2023-01-28 12:05:11,732 INFO L231 Difference]: Finished difference. Result has 279 places, 532 transitions, 10746 flow [2023-01-28 12:05:11,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=8028, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=10746, PETRI_PLACES=279, PETRI_TRANSITIONS=532} [2023-01-28 12:05:11,734 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 257 predicate places. [2023-01-28 12:05:11,734 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 532 transitions, 10746 flow [2023-01-28 12:05:11,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 82.61764705882354) internal successors, (2809), 34 states have internal predecessors, (2809), 0 states have call successors, (0), 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-28 12:05:11,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:05:11,734 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-28 12:05:11,741 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-28 12:05:11,939 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,SelfDestructingSolverStorable14 [2023-01-28 12:05:11,939 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-28 12:05:11,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:05:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 579527195, now seen corresponding path program 10 times [2023-01-28 12:05:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:05:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477092512] [2023-01-28 12:05:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:05:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:05:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:05:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 12:05:12,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:05:12,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477092512] [2023-01-28 12:05:12,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477092512] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 12:05:12,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 12:05:12,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 12:05:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622747343] [2023-01-28 12:05:12,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 12:05:12,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 12:05:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:05:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 12:05:12,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 12:05:12,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-28 12:05:12,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 532 transitions, 10746 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-28 12:05:12,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:05:12,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-28 12:05:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:05:13,043 INFO L130 PetriNetUnfolder]: 1377/2588 cut-off events. [2023-01-28 12:05:13,043 INFO L131 PetriNetUnfolder]: For 43166/43166 co-relation queries the response was YES. [2023-01-28 12:05:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23137 conditions, 2588 events. 1377/2588 cut-off events. For 43166/43166 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16044 event pairs, 256 based on Foata normal form. 10/2596 useless extension candidates. Maximal degree in co-relation 22779. Up to 2505 conditions per place. [2023-01-28 12:05:13,088 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 510 selfloop transitions, 18 changer transitions 0/528 dead transitions. [2023-01-28 12:05:13,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 528 transitions, 11671 flow [2023-01-28 12:05:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 12:05:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 12:05:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-01-28 12:05:13,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468063872255489 [2023-01-28 12:05:13,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-01-28 12:05:13,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-01-28 12:05:13,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:05:13,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-01-28 12:05:13,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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-28 12:05:13,108 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-28 12:05:13,108 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-28 12:05:13,108 INFO L175 Difference]: Start difference. First operand has 279 places, 532 transitions, 10746 flow. Second operand 3 states and 469 transitions. [2023-01-28 12:05:13,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 528 transitions, 11671 flow [2023-01-28 12:05:13,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 528 transitions, 11333 flow, removed 105 selfloop flow, removed 16 redundant places. [2023-01-28 12:05:13,659 INFO L231 Difference]: Finished difference. Result has 266 places, 526 transitions, 10326 flow [2023-01-28 12:05:13,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10268, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10326, PETRI_PLACES=266, PETRI_TRANSITIONS=526} [2023-01-28 12:05:13,660 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 244 predicate places. [2023-01-28 12:05:13,660 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 526 transitions, 10326 flow [2023-01-28 12:05:13,660 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-28 12:05:13,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:05:13,660 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-28 12:05:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 12:05:13,661 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-28 12:05:13,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:05:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -840201374, now seen corresponding path program 11 times [2023-01-28 12:05:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:05:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938340392] [2023-01-28 12:05:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:05:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:05:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:05:16,024 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-28 12:05:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:05:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938340392] [2023-01-28 12:05:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938340392] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:05:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190304555] [2023-01-28 12:05:16,024 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 12:05:16,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:05:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:05:16,025 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-28 12:05:16,028 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-28 12:05:16,115 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 12:05:16,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 12:05:16,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 12:05:16,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:05:16,372 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-01-28 12:05:16,373 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-28 12:05:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 12:05:16,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:05:16,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:16,773 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-28 12:05:30,376 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-28 12:05:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190304555] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 12:05:30,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 12:05:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 28 [2023-01-28 12:05:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951748814] [2023-01-28 12:05:30,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 12:05:30,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 12:05:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 12:05:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 12:05:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2023-01-28 12:05:30,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 334 [2023-01-28 12:05:30,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 526 transitions, 10326 flow. Second operand has 30 states, 30 states have (on average 90.9) internal successors, (2727), 30 states have internal predecessors, (2727), 0 states have call successors, (0), 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-28 12:05:30,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 12:05:30,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 334 [2023-01-28 12:05:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 12:05:33,077 INFO L130 PetriNetUnfolder]: 1514/2859 cut-off events. [2023-01-28 12:05:33,077 INFO L131 PetriNetUnfolder]: For 42434/42434 co-relation queries the response was YES. [2023-01-28 12:05:33,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24901 conditions, 2859 events. 1514/2859 cut-off events. For 42434/42434 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18631 event pairs, 119 based on Foata normal form. 20/2876 useless extension candidates. Maximal degree in co-relation 24544. Up to 1625 conditions per place. [2023-01-28 12:05:33,102 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 187 selfloop transitions, 434 changer transitions 28/649 dead transitions. [2023-01-28 12:05:33,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 649 transitions, 13310 flow [2023-01-28 12:05:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-01-28 12:05:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-01-28 12:05:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2902 transitions. [2023-01-28 12:05:33,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.280278153370678 [2023-01-28 12:05:33,110 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2902 transitions. [2023-01-28 12:05:33,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2902 transitions. [2023-01-28 12:05:33,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 12:05:33,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2902 transitions. [2023-01-28 12:05:33,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 93.61290322580645) internal successors, (2902), 31 states have internal predecessors, (2902), 0 states have call successors, (0), 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-28 12:05:33,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 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-28 12:05:33,118 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 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-28 12:05:33,119 INFO L175 Difference]: Start difference. First operand has 266 places, 526 transitions, 10326 flow. Second operand 31 states and 2902 transitions. [2023-01-28 12:05:33,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 649 transitions, 13310 flow [2023-01-28 12:05:33,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 649 transitions, 13263 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-01-28 12:05:33,355 INFO L231 Difference]: Finished difference. Result has 305 places, 576 transitions, 12865 flow [2023-01-28 12:05:33,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=10221, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=12865, PETRI_PLACES=305, PETRI_TRANSITIONS=576} [2023-01-28 12:05:33,356 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 283 predicate places. [2023-01-28 12:05:33,356 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 576 transitions, 12865 flow [2023-01-28 12:05:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.9) internal successors, (2727), 30 states have internal predecessors, (2727), 0 states have call successors, (0), 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-28 12:05:33,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 12:05:33,357 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-28 12:05:33,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 12:05:33,563 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-28 12:05:33,563 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-28 12:05:33,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 12:05:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1252697641, now seen corresponding path program 12 times [2023-01-28 12:05:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 12:05:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654273216] [2023-01-28 12:05:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 12:05:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 12:05:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 12:05:34,953 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-28 12:05:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 12:05:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654273216] [2023-01-28 12:05:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654273216] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 12:05:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449314253] [2023-01-28 12:05:34,953 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 12:05:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 12:05:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 12:05:34,954 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-28 12:05:34,958 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-28 12:05:35,100 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 12:05:35,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 12:05:35,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 62 conjunts are in the unsatisfiable core [2023-01-28 12:05:35,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 12:05:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:05:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:05:35,133 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 12:05:35,134 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-28 12:05:35,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 15 treesize of output 11 [2023-01-28 12:05:35,261 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 12:05:35,262 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-28 12:05:35,324 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-28 12:05:35,389 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-28 12:05:35,448 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-28 12:05:35,473 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-28 12:05:35,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 12:05:35,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 29 treesize of output 29 [2023-01-28 12:05:35,872 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-01-28 12:05:35,873 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 62 treesize of output 22 [2023-01-28 12:05:35,915 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-28 12:05:35,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 12:05:37,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:37,343 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 130 treesize of output 94 [2023-01-28 12:05:37,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:37,389 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 2909 treesize of output 2849 [2023-01-28 12:05:37,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:37,472 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 352 treesize of output 408 [2023-01-28 12:05:37,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:37,531 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 401 treesize of output 433 [2023-01-28 12:05:37,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:05:37,573 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 330 treesize of output 298 [2023-01-28 12:07:11,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:07:11,126 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 159 treesize of output 111 [2023-01-28 12:07:11,189 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-28 12:07:11,189 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 16649 treesize of output 15577 [2023-01-28 12:07:11,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:07:11,485 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 1895 treesize of output 1861 [2023-01-28 12:07:11,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:07:11,560 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 1781 treesize of output 1633 [2023-01-28 12:07:11,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 12:07:11,647 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 1530 treesize of output 1138 Received shutdown request... [2023-01-28 12:08:01,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 12:08:01,739 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 12:08:01,740 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-28 12:08:01,755 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-28 12:08:01,936 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-28 12:08:01,937 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-29-6-3-5-3-4-5-8-5-6-3-4-3-3-2-3-3-2-2-1 context. [2023-01-28 12:08:01,939 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-28 12:08:01,939 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-28 12:08:01,939 INFO L445 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1, 1] [2023-01-28 12:08:01,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 12:08:01,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 12:08:01,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:08:01 BasicIcfg [2023-01-28 12:08:01,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 12:08:01,945 INFO L158 Benchmark]: Toolchain (without parser) took 858969.71ms. Allocated memory was 736.1MB in the beginning and 1.9GB in the end (delta: 1.1GB). Free memory was 683.1MB in the beginning and 1.7GB in the end (delta: -975.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 318.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.76ms. Allocated memory is still 736.1MB. Free memory was 682.6MB in the beginning and 671.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.89ms. Allocated memory is still 736.1MB. Free memory was 671.0MB in the beginning and 668.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: Boogie Preprocessor took 18.90ms. Allocated memory is still 736.1MB. Free memory was 668.9MB in the beginning and 667.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: RCFGBuilder took 475.32ms. Allocated memory is still 736.1MB. Free memory was 667.3MB in the beginning and 637.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 12:08:01,946 INFO L158 Benchmark]: TraceAbstraction took 858259.95ms. Allocated memory was 736.1MB in the beginning and 1.9GB in the end (delta: 1.1GB). Free memory was 637.0MB in the beginning and 1.7GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-28 12:08:01,947 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 318.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 182.76ms. Allocated memory is still 736.1MB. Free memory was 682.6MB in the beginning and 671.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.89ms. Allocated memory is still 736.1MB. Free memory was 671.0MB in the beginning and 668.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.90ms. Allocated memory is still 736.1MB. Free memory was 668.9MB in the beginning and 667.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 475.32ms. Allocated memory is still 736.1MB. Free memory was 667.3MB in the beginning and 637.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 858259.95ms. Allocated memory was 736.1MB in the beginning and 1.9GB in the end (delta: 1.1GB). Free memory was 637.0MB in the beginning and 1.7GB in the end (delta: -1.0GB). 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.0s, 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-29-6-3-5-3-4-5-8-5-6-3-4-3-3-2-3-3-2-2-1 context. - 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-29-6-3-5-3-4-5-8-5-6-3-4-3-3-2-3-3-2-2-1 context. - 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 PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-29-6-3-5-3-4-5-8-5-6-3-4-3-3-2-3-3-2-2-1 context. - 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: 858.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 168.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 258 mSolverCounterUnknown, 2252 SdHoareTripleChecker+Valid, 22.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2252 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 644 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11146 IncrementalHoareTripleChecker+Invalid, 12684 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 0 mSDtfsCounter, 11146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 153 SyntacticMatches, 10 SemanticMatches, 592 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 7435 ImplicationChecksByTransitivity, 153.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12865occurred in iteration=17, InterpolantAutomatonStates: 387, 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.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 533.8s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 619 ConstructedInterpolants, 82 QuantifiedInterpolants, 22897 SizeOfPredicates, 270 NumberOfNonLiveVariables, 2196 ConjunctsInSsa, 564 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 32/144 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