/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-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 10:11:27,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 10:11:27,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 10:11:27,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 10:11:27,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 10:11:27,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 10:11:27,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 10:11:27,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 10:11:27,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 10:11:27,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 10:11:27,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 10:11:27,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 10:11:27,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 10:11:27,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 10:11:27,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 10:11:27,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 10:11:27,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 10:11:27,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 10:11:27,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 10:11:27,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 10:11:27,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 10:11:27,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 10:11:27,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 10:11:27,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 10:11:27,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 10:11:27,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 10:11:27,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 10:11:27,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 10:11:27,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 10:11:27,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 10:11:27,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 10:11:27,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 10:11:27,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 10:11:27,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 10:11:27,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 10:11:27,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 10:11:27,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 10:11:27,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 10:11:27,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 10:11:27,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 10:11:27,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 10:11:27,629 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 10:11:27,646 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 10:11:27,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 10:11:27,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 10:11:27,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 10:11:27,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 10:11:27,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 10:11:27,648 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 10:11:27,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 10:11:27,648 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 10:11:27,649 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 10:11:27,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:11:27,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 10:11:27,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 10:11:27,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 10:11:27,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 10:11:27,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 10:11:27,651 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 10:11:27,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 10:11:27,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 10:11:27,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 10:11:27,844 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 10:11:27,844 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 10:11:27,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2023-01-28 10:11:28,757 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 10:11:28,970 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 10:11:28,970 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2023-01-28 10:11:28,977 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b7590d64/8862bdc2af724d008426ccf00527cb5b/FLAGefd4e184b [2023-01-28 10:11:28,989 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b7590d64/8862bdc2af724d008426ccf00527cb5b [2023-01-28 10:11:28,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 10:11:28,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 10:11:28,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 10:11:28,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 10:11:28,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 10:11:28,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:28" (1/1) ... [2023-01-28 10:11:28,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6825566b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:28, skipping insertion in model container [2023-01-28 10:11:28,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:28" (1/1) ... [2023-01-28 10:11:29,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 10:11:29,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 10:11:29,171 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-bad-ring.wvr.c[3947,3960] [2023-01-28 10:11:29,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:11:29,187 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 10:11:29,223 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-bad-ring.wvr.c[3947,3960] [2023-01-28 10:11:29,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:11:29,236 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:11:29,237 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:11:29,242 INFO L208 MainTranslator]: Completed translation [2023-01-28 10:11:29,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29 WrapperNode [2023-01-28 10:11:29,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 10:11:29,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 10:11:29,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 10:11:29,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 10:11:29,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,295 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 325 [2023-01-28 10:11:29,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 10:11:29,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 10:11:29,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 10:11:29,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 10:11:29,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,331 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 10:11:29,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 10:11:29,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 10:11:29,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 10:11:29,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (1/1) ... [2023-01-28 10:11:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:11:29,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:29,366 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 10:11:29,387 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 10:11:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 10:11:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 10:11:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 10:11:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 10:11:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 10:11:29,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 10:11:29,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 10:11:29,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 10:11:29,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 10:11:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 10:11:29,408 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 10:11:29,498 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 10:11:29,499 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 10:11:29,800 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 10:11:29,893 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 10:11:29,893 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-28 10:11:29,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:29 BoogieIcfgContainer [2023-01-28 10:11:29,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 10:11:29,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 10:11:29,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 10:11:29,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 10:11:29,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:11:28" (1/3) ... [2023-01-28 10:11:29,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ce585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:29, skipping insertion in model container [2023-01-28 10:11:29,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:29" (2/3) ... [2023-01-28 10:11:29,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ce585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:29, skipping insertion in model container [2023-01-28 10:11:29,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:29" (3/3) ... [2023-01-28 10:11:29,900 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2023-01-28 10:11:29,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 10:11:29,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 10:11:29,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 10:11:29,983 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 10:11:30,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 255 transitions, 534 flow [2023-01-28 10:11:30,089 INFO L130 PetriNetUnfolder]: 22/252 cut-off events. [2023-01-28 10:11:30,089 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:11:30,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 22/252 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 214. Up to 3 conditions per place. [2023-01-28 10:11:30,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 255 transitions, 534 flow [2023-01-28 10:11:30,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 242 transitions, 502 flow [2023-01-28 10:11:30,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 10:11:30,109 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 242 transitions, 502 flow [2023-01-28 10:11:30,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 242 transitions, 502 flow [2023-01-28 10:11:30,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 242 transitions, 502 flow [2023-01-28 10:11:30,137 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2023-01-28 10:11:30,137 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:11:30,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 157 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 214. Up to 3 conditions per place. [2023-01-28 10:11:30,139 INFO L119 LiptonReduction]: Number of co-enabled transitions 1962 [2023-01-28 10:11:37,094 INFO L134 LiptonReduction]: Checked pairs total: 3161 [2023-01-28 10:11:37,095 INFO L136 LiptonReduction]: Total number of compositions: 252 [2023-01-28 10:11:37,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 10:11:37,111 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;@155abd89, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 10:11:37,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 10:11:37,117 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2023-01-28 10:11:37,117 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:11:37,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:37,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:37,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:37,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1137441367, now seen corresponding path program 1 times [2023-01-28 10:11:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872255097] [2023-01-28 10:11:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:37,353 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 10:11:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872255097] [2023-01-28 10:11:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872255097] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:11:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031824272] [2023-01-28 10:11:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:37,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 10:11:37,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 10:11:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 10:11:37,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 507 [2023-01-28 10:11:37,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 236.0) internal successors, (472), 2 states have internal predecessors, (472), 0 states have call successors, (0), 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 10:11:37,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:37,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 507 [2023-01-28 10:11:37,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:37,495 INFO L130 PetriNetUnfolder]: 468/682 cut-off events. [2023-01-28 10:11:37,495 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-01-28 10:11:37,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 682 events. 468/682 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2010 event pairs, 333 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 1160. Up to 683 conditions per place. [2023-01-28 10:11:37,501 INFO L137 encePairwiseOnDemand]: 505/507 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-01-28 10:11:37,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2023-01-28 10:11:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 10:11:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 10:11:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 483 transitions. [2023-01-28 10:11:37,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47633136094674555 [2023-01-28 10:11:37,518 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 483 transitions. [2023-01-28 10:11:37,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 483 transitions. [2023-01-28 10:11:37,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:37,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 483 transitions. [2023-01-28 10:11:37,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 241.5) internal successors, (483), 2 states have internal predecessors, (483), 0 states have call successors, (0), 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 10:11:37,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 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 10:11:37,528 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 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 10:11:37,529 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 2 states and 483 transitions. [2023-01-28 10:11:37,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2023-01-28 10:11:37,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-28 10:11:37,533 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 68 flow [2023-01-28 10:11:37,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2023-01-28 10:11:37,545 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2023-01-28 10:11:37,545 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 68 flow [2023-01-28 10:11:37,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 236.0) internal successors, (472), 2 states have internal predecessors, (472), 0 states have call successors, (0), 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 10:11:37,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:37,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:37,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 10:11:37,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:37,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash -341274689, now seen corresponding path program 1 times [2023-01-28 10:11:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145528124] [2023-01-28 10:11:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:37,765 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 10:11:37,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145528124] [2023-01-28 10:11:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145528124] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:11:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230878981] [2023-01-28 10:11:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:11:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:11:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:11:37,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 507 [2023-01-28 10:11:37,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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 10:11:37,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:37,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 507 [2023-01-28 10:11:37,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:37,886 INFO L130 PetriNetUnfolder]: 529/791 cut-off events. [2023-01-28 10:11:37,887 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-28 10:11:37,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 791 events. 529/791 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2481 event pairs, 384 based on Foata normal form. 42/687 useless extension candidates. Maximal degree in co-relation 1610. Up to 683 conditions per place. [2023-01-28 10:11:37,890 INFO L137 encePairwiseOnDemand]: 501/507 looper letters, 30 selfloop transitions, 2 changer transitions 17/49 dead transitions. [2023-01-28 10:11:37,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 205 flow [2023-01-28 10:11:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:11:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:11:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 808 transitions. [2023-01-28 10:11:37,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398422090729783 [2023-01-28 10:11:37,892 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 808 transitions. [2023-01-28 10:11:37,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 808 transitions. [2023-01-28 10:11:37,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:37,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 808 transitions. [2023-01-28 10:11:37,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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 10:11:37,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:11:37,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:11:37,899 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 68 flow. Second operand 4 states and 808 transitions. [2023-01-28 10:11:37,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 205 flow [2023-01-28 10:11:37,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 10:11:37,901 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2023-01-28 10:11:37,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-01-28 10:11:37,901 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2023-01-28 10:11:37,901 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2023-01-28 10:11:37,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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 10:11:37,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:37,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:37,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 10:11:37,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:37,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1803368648, now seen corresponding path program 1 times [2023-01-28 10:11:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339070594] [2023-01-28 10:11:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:11:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339070594] [2023-01-28 10:11:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339070594] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:38,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:38,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:11:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052292712] [2023-01-28 10:11:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:38,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:11:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:38,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:11:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:11:38,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 507 [2023-01-28 10:11:38,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 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 10:11:38,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:38,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 507 [2023-01-28 10:11:38,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:38,211 INFO L130 PetriNetUnfolder]: 755/1159 cut-off events. [2023-01-28 10:11:38,211 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2023-01-28 10:11:38,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 1159 events. 755/1159 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4347 event pairs, 579 based on Foata normal form. 116/1097 useless extension candidates. Maximal degree in co-relation 2646. Up to 684 conditions per place. [2023-01-28 10:11:38,215 INFO L137 encePairwiseOnDemand]: 500/507 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2023-01-28 10:11:38,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 314 flow [2023-01-28 10:11:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:11:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:11:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1018 transitions. [2023-01-28 10:11:38,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40157790927021697 [2023-01-28 10:11:38,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1018 transitions. [2023-01-28 10:11:38,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1018 transitions. [2023-01-28 10:11:38,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:38,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1018 transitions. [2023-01-28 10:11:38,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 0 states have call successors, (0), 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 10:11:38,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 507.0) internal successors, (3042), 6 states have internal predecessors, (3042), 0 states have call successors, (0), 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 10:11:38,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 507.0) internal successors, (3042), 6 states have internal predecessors, (3042), 0 states have call successors, (0), 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 10:11:38,224 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 5 states and 1018 transitions. [2023-01-28 10:11:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 314 flow [2023-01-28 10:11:38,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 68 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 10:11:38,226 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 108 flow [2023-01-28 10:11:38,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-01-28 10:11:38,227 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-01-28 10:11:38,229 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 108 flow [2023-01-28 10:11:38,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 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 10:11:38,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:38,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:38,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 10:11:38,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:38,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1356236085, now seen corresponding path program 1 times [2023-01-28 10:11:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165238559] [2023-01-28 10:11:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165238559] [2023-01-28 10:11:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165238559] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:38,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:11:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058151276] [2023-01-28 10:11:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:11:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:11:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:11:38,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 507 [2023-01-28 10:11:38,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 0 states have call successors, (0), 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 10:11:38,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:38,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 507 [2023-01-28 10:11:38,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:38,501 INFO L130 PetriNetUnfolder]: 759/1143 cut-off events. [2023-01-28 10:11:38,501 INFO L131 PetriNetUnfolder]: For 431/431 co-relation queries the response was YES. [2023-01-28 10:11:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1143 events. 759/1143 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4122 event pairs, 586 based on Foata normal form. 76/1014 useless extension candidates. Maximal degree in co-relation 3088. Up to 685 conditions per place. [2023-01-28 10:11:38,506 INFO L137 encePairwiseOnDemand]: 501/507 looper letters, 32 selfloop transitions, 2 changer transitions 20/54 dead transitions. [2023-01-28 10:11:38,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 283 flow [2023-01-28 10:11:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:11:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:11:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 811 transitions. [2023-01-28 10:11:38,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39990138067061143 [2023-01-28 10:11:38,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 811 transitions. [2023-01-28 10:11:38,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 811 transitions. [2023-01-28 10:11:38,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:38,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 811 transitions. [2023-01-28 10:11:38,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 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 10:11:38,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:11:38,514 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:11:38,514 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 108 flow. Second operand 4 states and 811 transitions. [2023-01-28 10:11:38,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 283 flow [2023-01-28 10:11:38,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 263 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-28 10:11:38,516 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 114 flow [2023-01-28 10:11:38,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-28 10:11:38,517 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-01-28 10:11:38,517 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 114 flow [2023-01-28 10:11:38,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 0 states have call successors, (0), 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 10:11:38,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:38,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:38,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 10:11:38,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:38,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2052825742, now seen corresponding path program 1 times [2023-01-28 10:11:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366737756] [2023-01-28 10:11:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:11:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366737756] [2023-01-28 10:11:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366737756] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:11:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441235424] [2023-01-28 10:11:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:38,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:11:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:11:38,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:11:38,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 507 [2023-01-28 10:11:38,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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 10:11:38,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:38,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 507 [2023-01-28 10:11:38,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:38,744 INFO L130 PetriNetUnfolder]: 834/1218 cut-off events. [2023-01-28 10:11:38,744 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2023-01-28 10:11:38,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 1218 events. 834/1218 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4372 event pairs, 333 based on Foata normal form. 1/972 useless extension candidates. Maximal degree in co-relation 3221. Up to 642 conditions per place. [2023-01-28 10:11:38,749 INFO L137 encePairwiseOnDemand]: 504/507 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-01-28 10:11:38,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 289 flow [2023-01-28 10:11:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:11:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:11:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2023-01-28 10:11:38,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707429322813938 [2023-01-28 10:11:38,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2023-01-28 10:11:38,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2023-01-28 10:11:38,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:38,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2023-01-28 10:11:38,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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 10:11:38,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:38,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:38,755 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 114 flow. Second operand 3 states and 716 transitions. [2023-01-28 10:11:38,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 289 flow [2023-01-28 10:11:38,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 285 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 10:11:38,757 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 124 flow [2023-01-28 10:11:38,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-01-28 10:11:38,758 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2023-01-28 10:11:38,758 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 124 flow [2023-01-28 10:11:38,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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 10:11:38,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:38,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:38,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 10:11:38,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:38,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash 402993380, now seen corresponding path program 1 times [2023-01-28 10:11:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356641800] [2023-01-28 10:11:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356641800] [2023-01-28 10:11:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356641800] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:11:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470271211] [2023-01-28 10:11:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:38,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:38,881 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 10:11:38,882 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 10:11:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:38,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:11:38,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:11:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:39,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:11:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470271211] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:11:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:11:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-28 10:11:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561923654] [2023-01-28 10:11:39,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:11:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 10:11:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 10:11:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-01-28 10:11:39,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 507 [2023-01-28 10:11:39,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 124 flow. Second operand has 11 states, 11 states have (on average 191.27272727272728) internal successors, (2104), 11 states have internal predecessors, (2104), 0 states have call successors, (0), 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 10:11:39,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:39,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 507 [2023-01-28 10:11:39,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:39,458 INFO L130 PetriNetUnfolder]: 1355/2016 cut-off events. [2023-01-28 10:11:39,458 INFO L131 PetriNetUnfolder]: For 722/722 co-relation queries the response was YES. [2023-01-28 10:11:39,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 2016 events. 1355/2016 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8244 event pairs, 714 based on Foata normal form. 72/1706 useless extension candidates. Maximal degree in co-relation 5505. Up to 1218 conditions per place. [2023-01-28 10:11:39,464 INFO L137 encePairwiseOnDemand]: 501/507 looper letters, 33 selfloop transitions, 3 changer transitions 42/78 dead transitions. [2023-01-28 10:11:39,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 419 flow [2023-01-28 10:11:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:11:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:11:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2023-01-28 10:11:39,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39349112426035504 [2023-01-28 10:11:39,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2023-01-28 10:11:39,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2023-01-28 10:11:39,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:39,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2023-01-28 10:11:39,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 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 10:11:39,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 507.0) internal successors, (3549), 7 states have internal predecessors, (3549), 0 states have call successors, (0), 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 10:11:39,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 507.0) internal successors, (3549), 7 states have internal predecessors, (3549), 0 states have call successors, (0), 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 10:11:39,473 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 124 flow. Second operand 6 states and 1197 transitions. [2023-01-28 10:11:39,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 419 flow [2023-01-28 10:11:39,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 10:11:39,476 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 148 flow [2023-01-28 10:11:39,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-01-28 10:11:39,477 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-01-28 10:11:39,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 148 flow [2023-01-28 10:11:39,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 191.27272727272728) internal successors, (2104), 11 states have internal predecessors, (2104), 0 states have call successors, (0), 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 10:11:39,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:39,478 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:39,483 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 10:11:39,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 10:11:39,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:39,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1520183157, now seen corresponding path program 2 times [2023-01-28 10:11:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:39,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906473480] [2023-01-28 10:11:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:39,836 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 10:11:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906473480] [2023-01-28 10:11:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906473480] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:39,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:11:39,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408852210] [2023-01-28 10:11:39,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:11:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:11:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:11:39,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 507 [2023-01-28 10:11:39,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 10:11:39,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:39,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 507 [2023-01-28 10:11:39,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:39,951 INFO L130 PetriNetUnfolder]: 906/1311 cut-off events. [2023-01-28 10:11:39,951 INFO L131 PetriNetUnfolder]: For 950/950 co-relation queries the response was YES. [2023-01-28 10:11:39,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 1311 events. 906/1311 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4447 event pairs, 287 based on Foata normal form. 34/1052 useless extension candidates. Maximal degree in co-relation 3971. Up to 844 conditions per place. [2023-01-28 10:11:39,956 INFO L137 encePairwiseOnDemand]: 503/507 looper letters, 43 selfloop transitions, 3 changer transitions 5/51 dead transitions. [2023-01-28 10:11:39,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 308 flow [2023-01-28 10:11:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:11:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:11:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2023-01-28 10:11:39,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46679815910585143 [2023-01-28 10:11:39,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 710 transitions. [2023-01-28 10:11:39,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 710 transitions. [2023-01-28 10:11:39,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:39,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 710 transitions. [2023-01-28 10:11:39,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 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 10:11:39,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:39,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:39,961 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 148 flow. Second operand 3 states and 710 transitions. [2023-01-28 10:11:39,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 308 flow [2023-01-28 10:11:39,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 280 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-28 10:11:39,963 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 153 flow [2023-01-28 10:11:39,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-01-28 10:11:39,964 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-01-28 10:11:39,964 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 153 flow [2023-01-28 10:11:39,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 10:11:39,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:39,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:39,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 10:11:39,965 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:39,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -821181061, now seen corresponding path program 3 times [2023-01-28 10:11:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043298492] [2023-01-28 10:11:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043298492] [2023-01-28 10:11:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043298492] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:11:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301423636] [2023-01-28 10:11:40,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:11:40,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:40,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:40,585 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 10:11:40,587 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 10:11:40,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:11:40,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:11:40,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 10:11:40,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:11:40,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 822 [2023-01-28 10:11:40,831 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 10:11:40,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-28 10:11:40,864 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 10:11:40,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 10:11:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301423636] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 10:11:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-01-28 10:11:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197582305] [2023-01-28 10:11:40,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:40,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 10:11:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 10:11:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-01-28 10:11:40,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 507 [2023-01-28 10:11:40,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 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 10:11:40,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:40,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 507 [2023-01-28 10:11:40,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:41,109 INFO L130 PetriNetUnfolder]: 1046/1548 cut-off events. [2023-01-28 10:11:41,110 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2023-01-28 10:11:41,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 1548 events. 1046/1548 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5963 event pairs, 300 based on Foata normal form. 28/1283 useless extension candidates. Maximal degree in co-relation 4669. Up to 901 conditions per place. [2023-01-28 10:11:41,115 INFO L137 encePairwiseOnDemand]: 500/507 looper letters, 80 selfloop transitions, 6 changer transitions 2/88 dead transitions. [2023-01-28 10:11:41,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 534 flow [2023-01-28 10:11:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 10:11:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 10:11:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1412 transitions. [2023-01-28 10:11:41,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978585517047056 [2023-01-28 10:11:41,118 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1412 transitions. [2023-01-28 10:11:41,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1412 transitions. [2023-01-28 10:11:41,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:41,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1412 transitions. [2023-01-28 10:11:41,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.71428571428572) internal successors, (1412), 7 states have internal predecessors, (1412), 0 states have call successors, (0), 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 10:11:41,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 507.0) internal successors, (4056), 8 states have internal predecessors, (4056), 0 states have call successors, (0), 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 10:11:41,125 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 507.0) internal successors, (4056), 8 states have internal predecessors, (4056), 0 states have call successors, (0), 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 10:11:41,125 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 153 flow. Second operand 7 states and 1412 transitions. [2023-01-28 10:11:41,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 534 flow [2023-01-28 10:11:41,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 509 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 10:11:41,127 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 189 flow [2023-01-28 10:11:41,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-01-28 10:11:41,128 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-01-28 10:11:41,128 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 189 flow [2023-01-28 10:11:41,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 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 10:11:41,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:41,129 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:41,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 10:11:41,334 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,SelfDestructingSolverStorable7 [2023-01-28 10:11:41,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:41,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2136771815, now seen corresponding path program 4 times [2023-01-28 10:11:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:41,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727744622] [2023-01-28 10:11:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727744622] [2023-01-28 10:11:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727744622] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:11:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511940434] [2023-01-28 10:11:41,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 10:11:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:41,918 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 10:11:41,920 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 10:11:42,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 10:11:42,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:11:42,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 10:11:42,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:11:42,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:11:42,245 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 10:11:42,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:11:42,296 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 10:11:42,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-01-28 10:11:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:42,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:11:42,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:11:42,538 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 157 treesize of output 141 [2023-01-28 10:11:42,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-01-28 10:11:42,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-01-28 10:11:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:11:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511940434] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:11:42,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:11:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-01-28 10:11:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865874230] [2023-01-28 10:11:42,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:11:42,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 10:11:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 10:11:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=743, Unknown=3, NotChecked=0, Total=870 [2023-01-28 10:11:42,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 507 [2023-01-28 10:11:42,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 189 flow. Second operand has 30 states, 30 states have (on average 160.6) internal successors, (4818), 30 states have internal predecessors, (4818), 0 states have call successors, (0), 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 10:11:42,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:42,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 507 [2023-01-28 10:11:42,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:44,418 INFO L130 PetriNetUnfolder]: 3054/4541 cut-off events. [2023-01-28 10:11:44,419 INFO L131 PetriNetUnfolder]: For 4864/4864 co-relation queries the response was YES. [2023-01-28 10:11:44,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14995 conditions, 4541 events. 3054/4541 cut-off events. For 4864/4864 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21756 event pairs, 739 based on Foata normal form. 198/4110 useless extension candidates. Maximal degree in co-relation 14979. Up to 1117 conditions per place. [2023-01-28 10:11:44,439 INFO L137 encePairwiseOnDemand]: 497/507 looper letters, 213 selfloop transitions, 35 changer transitions 24/272 dead transitions. [2023-01-28 10:11:44,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 272 transitions, 1739 flow [2023-01-28 10:11:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-28 10:11:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-01-28 10:11:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4033 transitions. [2023-01-28 10:11:44,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3314431295200526 [2023-01-28 10:11:44,447 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4033 transitions. [2023-01-28 10:11:44,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4033 transitions. [2023-01-28 10:11:44,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:44,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4033 transitions. [2023-01-28 10:11:44,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 168.04166666666666) internal successors, (4033), 24 states have internal predecessors, (4033), 0 states have call successors, (0), 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 10:11:44,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 507.0) internal successors, (12675), 25 states have internal predecessors, (12675), 0 states have call successors, (0), 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 10:11:44,468 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 507.0) internal successors, (12675), 25 states have internal predecessors, (12675), 0 states have call successors, (0), 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 10:11:44,468 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 189 flow. Second operand 24 states and 4033 transitions. [2023-01-28 10:11:44,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 272 transitions, 1739 flow [2023-01-28 10:11:44,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 272 transitions, 1718 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 10:11:44,476 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 561 flow [2023-01-28 10:11:44,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=561, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2023-01-28 10:11:44,477 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2023-01-28 10:11:44,477 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 561 flow [2023-01-28 10:11:44,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 160.6) internal successors, (4818), 30 states have internal predecessors, (4818), 0 states have call successors, (0), 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 10:11:44,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:44,478 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:44,485 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 10:11:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:44,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:44,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1230266139, now seen corresponding path program 5 times [2023-01-28 10:11:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255660389] [2023-01-28 10:11:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:44,822 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 10:11:44,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:44,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255660389] [2023-01-28 10:11:44,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255660389] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:11:44,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:11:44,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:11:44,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367840916] [2023-01-28 10:11:44,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:11:44,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:11:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:11:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:11:44,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 507 [2023-01-28 10:11:44,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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 10:11:44,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:44,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 507 [2023-01-28 10:11:44,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:44,993 INFO L130 PetriNetUnfolder]: 1118/1789 cut-off events. [2023-01-28 10:11:44,993 INFO L131 PetriNetUnfolder]: For 6844/6844 co-relation queries the response was YES. [2023-01-28 10:11:44,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7734 conditions, 1789 events. 1118/1789 cut-off events. For 6844/6844 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7126 event pairs, 400 based on Foata normal form. 60/1658 useless extension candidates. Maximal degree in co-relation 7706. Up to 1363 conditions per place. [2023-01-28 10:11:45,010 INFO L137 encePairwiseOnDemand]: 503/507 looper letters, 71 selfloop transitions, 4 changer transitions 1/76 dead transitions. [2023-01-28 10:11:45,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 706 flow [2023-01-28 10:11:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:11:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:11:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2023-01-28 10:11:45,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45627876397107164 [2023-01-28 10:11:45,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 694 transitions. [2023-01-28 10:11:45,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 694 transitions. [2023-01-28 10:11:45,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:45,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 694 transitions. [2023-01-28 10:11:45,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 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 10:11:45,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:45,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 507.0) internal successors, (2028), 4 states have internal predecessors, (2028), 0 states have call successors, (0), 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 10:11:45,015 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 561 flow. Second operand 3 states and 694 transitions. [2023-01-28 10:11:45,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 706 flow [2023-01-28 10:11:45,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 575 flow, removed 55 selfloop flow, removed 10 redundant places. [2023-01-28 10:11:45,030 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 422 flow [2023-01-28 10:11:45,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-01-28 10:11:45,031 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2023-01-28 10:11:45,031 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 422 flow [2023-01-28 10:11:45,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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 10:11:45,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:45,032 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:45,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 10:11:45,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:45,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -969831955, now seen corresponding path program 1 times [2023-01-28 10:11:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921485919] [2023-01-28 10:11:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:11:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:45,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921485919] [2023-01-28 10:11:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921485919] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:11:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564419230] [2023-01-28 10:11:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:45,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:45,157 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 10:11:45,213 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 10:11:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:45,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:11:45,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:11:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:11:45,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:11:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:11:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564419230] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:11:45,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:11:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-01-28 10:11:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551632393] [2023-01-28 10:11:45,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:11:45,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 10:11:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 10:11:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-01-28 10:11:45,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 507 [2023-01-28 10:11:45,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 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 10:11:45,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:45,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 507 [2023-01-28 10:11:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:11:45,776 INFO L130 PetriNetUnfolder]: 1919/3133 cut-off events. [2023-01-28 10:11:45,777 INFO L131 PetriNetUnfolder]: For 8973/8973 co-relation queries the response was YES. [2023-01-28 10:11:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12256 conditions, 3133 events. 1919/3133 cut-off events. For 8973/8973 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14883 event pairs, 925 based on Foata normal form. 176/2969 useless extension candidates. Maximal degree in co-relation 12233. Up to 1742 conditions per place. [2023-01-28 10:11:45,788 INFO L137 encePairwiseOnDemand]: 502/507 looper letters, 98 selfloop transitions, 9 changer transitions 20/127 dead transitions. [2023-01-28 10:11:45,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 1003 flow [2023-01-28 10:11:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:11:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:11:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2023-01-28 10:11:45,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39119000657462194 [2023-01-28 10:11:45,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1190 transitions. [2023-01-28 10:11:45,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1190 transitions. [2023-01-28 10:11:45,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:11:45,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1190 transitions. [2023-01-28 10:11:45,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 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 10:11:45,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 507.0) internal successors, (3549), 7 states have internal predecessors, (3549), 0 states have call successors, (0), 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 10:11:45,796 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 507.0) internal successors, (3549), 7 states have internal predecessors, (3549), 0 states have call successors, (0), 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 10:11:45,796 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 422 flow. Second operand 6 states and 1190 transitions. [2023-01-28 10:11:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 1003 flow [2023-01-28 10:11:45,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 127 transitions, 972 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-28 10:11:45,805 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 468 flow [2023-01-28 10:11:45,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2023-01-28 10:11:45,806 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2023-01-28 10:11:45,806 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 468 flow [2023-01-28 10:11:45,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 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 10:11:45,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:11:45,806 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:11:45,812 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 10:11:46,011 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 10:11:46,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:11:46,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:11:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1260700386, now seen corresponding path program 2 times [2023-01-28 10:11:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:11:46,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254698618] [2023-01-28 10:11:46,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:11:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:11:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:11:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:11:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:11:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254698618] [2023-01-28 10:11:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254698618] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:11:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531374396] [2023-01-28 10:11:47,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:11:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:11:47,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:11:47,018 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 10:11:47,020 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 10:11:47,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:11:47,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:11:47,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 10:11:47,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:11:47,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:11:47,546 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 16 treesize of output 18 [2023-01-28 10:11:47,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:11:47,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2023-01-28 10:11:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:11:47,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:11:48,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:11:48,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 190 [2023-01-28 10:11:48,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:11:48,201 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 87 treesize of output 97 [2023-01-28 10:11:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:11:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531374396] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:11:49,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:11:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 44 [2023-01-28 10:11:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659498354] [2023-01-28 10:11:49,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:11:49,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-01-28 10:11:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:11:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-01-28 10:11:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1712, Unknown=2, NotChecked=0, Total=1980 [2023-01-28 10:11:49,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 507 [2023-01-28 10:11:49,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 468 flow. Second operand has 45 states, 45 states have (on average 149.93333333333334) internal successors, (6747), 45 states have internal predecessors, (6747), 0 states have call successors, (0), 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 10:11:49,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:11:49,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 507 [2023-01-28 10:11:49,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:12:02,115 WARN L222 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 90 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:12:04,674 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 10:12:06,692 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 10:12:21,374 WARN L222 SmtUtils]: Spent 13.16s on a formula simplification. DAG size of input: 78 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:12:45,340 WARN L222 SmtUtils]: Spent 22.55s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:13:24,162 WARN L222 SmtUtils]: Spent 37.43s on a formula simplification. DAG size of input: 83 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:13:50,124 WARN L222 SmtUtils]: Spent 25.89s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:13:52,562 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 10:13:54,569 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 10:13:57,495 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 10:13:59,504 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 10:14:02,061 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 10:14:04,066 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 10:14:06,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:14:06,555 INFO L130 PetriNetUnfolder]: 2219/3785 cut-off events. [2023-01-28 10:14:06,555 INFO L131 PetriNetUnfolder]: For 10297/10297 co-relation queries the response was YES. [2023-01-28 10:14:06,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14392 conditions, 3785 events. 2219/3785 cut-off events. For 10297/10297 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20090 event pairs, 527 based on Foata normal form. 64/3482 useless extension candidates. Maximal degree in co-relation 14367. Up to 794 conditions per place. [2023-01-28 10:14:06,570 INFO L137 encePairwiseOnDemand]: 490/507 looper letters, 328 selfloop transitions, 111 changer transitions 29/468 dead transitions. [2023-01-28 10:14:06,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 468 transitions, 3345 flow [2023-01-28 10:14:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-28 10:14:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-01-28 10:14:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 8852 transitions. [2023-01-28 10:14:06,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3063081767535209 [2023-01-28 10:14:06,582 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 8852 transitions. [2023-01-28 10:14:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 8852 transitions. [2023-01-28 10:14:06,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:14:06,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 8852 transitions. [2023-01-28 10:14:06,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 155.2982456140351) internal successors, (8852), 57 states have internal predecessors, (8852), 0 states have call successors, (0), 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 10:14:06,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 507.0) internal successors, (29406), 58 states have internal predecessors, (29406), 0 states have call successors, (0), 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 10:14:06,617 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 507.0) internal successors, (29406), 58 states have internal predecessors, (29406), 0 states have call successors, (0), 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 10:14:06,617 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 468 flow. Second operand 57 states and 8852 transitions. [2023-01-28 10:14:06,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 468 transitions, 3345 flow [2023-01-28 10:14:06,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 468 transitions, 3242 flow, removed 43 selfloop flow, removed 3 redundant places. [2023-01-28 10:14:06,636 INFO L231 Difference]: Finished difference. Result has 165 places, 184 transitions, 1712 flow [2023-01-28 10:14:06,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1712, PETRI_PLACES=165, PETRI_TRANSITIONS=184} [2023-01-28 10:14:06,637 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 130 predicate places. [2023-01-28 10:14:06,637 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 184 transitions, 1712 flow [2023-01-28 10:14:06,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 149.93333333333334) internal successors, (6747), 45 states have internal predecessors, (6747), 0 states have call successors, (0), 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 10:14:06,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:14:06,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:14:06,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 10:14:06,843 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 10:14:06,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:14:06,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:14:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -716681592, now seen corresponding path program 3 times [2023-01-28 10:14:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:14:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872700002] [2023-01-28 10:14:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:14:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:14:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:14:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:14:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:14:07,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872700002] [2023-01-28 10:14:07,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872700002] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:14:07,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780413360] [2023-01-28 10:14:07,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:14:07,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:14:07,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:14:07,886 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 10:14:07,888 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 10:14:08,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:14:08,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:14:08,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-28 10:14:08,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:14:08,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:14:08,602 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-01-28 10:14:08,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2023-01-28 10:14:08,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2023-01-28 10:14:08,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-28 10:14:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:14:08,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:14:08,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:14:08,977 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 62 treesize of output 122 [2023-01-28 10:14:08,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-01-28 10:14:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:14:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780413360] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:14:09,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:14:09,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2023-01-28 10:14:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097999650] [2023-01-28 10:14:09,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:14:09,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 10:14:09,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:14:09,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 10:14:09,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1468, Unknown=6, NotChecked=0, Total=1640 [2023-01-28 10:14:09,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 507 [2023-01-28 10:14:09,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 184 transitions, 1712 flow. Second operand has 41 states, 41 states have (on average 147.1951219512195) internal successors, (6035), 41 states have internal predecessors, (6035), 0 states have call successors, (0), 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 10:14:09,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:14:09,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 507 [2023-01-28 10:14:09,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:14:20,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 10:14:25,217 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 [0] [2023-01-28 10:14:27,676 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 [0] [2023-01-28 10:14:32,137 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 [0] [2023-01-28 10:14:34,485 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 [0] [2023-01-28 10:14:37,673 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 [0] [2023-01-28 10:14:49,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 10:14:51,223 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 [0, 1] [2023-01-28 10:14:58,103 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 [0, 1] [2023-01-28 10:15:00,706 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 [0, 1] [2023-01-28 10:15:04,397 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 [0, 1] [2023-01-28 10:15:06,973 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 [0] [2023-01-28 10:15:11,770 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 [0] [2023-01-28 10:15:13,211 INFO L130 PetriNetUnfolder]: 19422/30993 cut-off events. [2023-01-28 10:15:13,211 INFO L131 PetriNetUnfolder]: For 226531/226531 co-relation queries the response was YES. [2023-01-28 10:15:13,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159003 conditions, 30993 events. 19422/30993 cut-off events. For 226531/226531 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 220495 event pairs, 2378 based on Foata normal form. 2480/32461 useless extension candidates. Maximal degree in co-relation 158952. Up to 7055 conditions per place. [2023-01-28 10:15:13,426 INFO L137 encePairwiseOnDemand]: 490/507 looper letters, 1507 selfloop transitions, 941 changer transitions 286/2734 dead transitions. [2023-01-28 10:15:13,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 2734 transitions, 27715 flow [2023-01-28 10:15:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2023-01-28 10:15:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2023-01-28 10:15:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 32828 transitions. [2023-01-28 10:15:13,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3025677892680049 [2023-01-28 10:15:13,451 INFO L72 ComplementDD]: Start complementDD. Operand 214 states and 32828 transitions. [2023-01-28 10:15:13,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 32828 transitions. [2023-01-28 10:15:13,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:15:13,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 214 states and 32828 transitions. [2023-01-28 10:15:13,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 215 states, 214 states have (on average 153.4018691588785) internal successors, (32828), 214 states have internal predecessors, (32828), 0 states have call successors, (0), 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 10:15:13,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 215 states, 215 states have (on average 507.0) internal successors, (109005), 215 states have internal predecessors, (109005), 0 states have call successors, (0), 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 10:15:13,574 INFO L81 ComplementDD]: Finished complementDD. Result has 215 states, 215 states have (on average 507.0) internal successors, (109005), 215 states have internal predecessors, (109005), 0 states have call successors, (0), 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 10:15:13,574 INFO L175 Difference]: Start difference. First operand has 165 places, 184 transitions, 1712 flow. Second operand 214 states and 32828 transitions. [2023-01-28 10:15:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 2734 transitions, 27715 flow [2023-01-28 10:15:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 2734 transitions, 24438 flow, removed 1587 selfloop flow, removed 8 redundant places. [2023-01-28 10:15:14,507 INFO L231 Difference]: Finished difference. Result has 491 places, 1160 transitions, 13740 flow [2023-01-28 10:15:14,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=214, PETRI_FLOW=13740, PETRI_PLACES=491, PETRI_TRANSITIONS=1160} [2023-01-28 10:15:14,507 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 456 predicate places. [2023-01-28 10:15:14,507 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 1160 transitions, 13740 flow [2023-01-28 10:15:14,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 147.1951219512195) internal successors, (6035), 41 states have internal predecessors, (6035), 0 states have call successors, (0), 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 10:15:14,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:15:14,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:15:14,514 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 10:15:14,714 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 10:15:14,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:15:14,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:15:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646834, now seen corresponding path program 4 times [2023-01-28 10:15:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:15:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898372760] [2023-01-28 10:15:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:15:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:15:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:15:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:15:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:15:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898372760] [2023-01-28 10:15:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898372760] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:15:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113448841] [2023-01-28 10:15:16,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 10:15:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:15:16,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:15:16,124 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 10:15:16,126 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 10:15:16,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 10:15:16,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:15:16,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 50 conjunts are in the unsatisfiable core [2023-01-28 10:15:16,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:15:16,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:15:16,688 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 16 treesize of output 18 [2023-01-28 10:15:16,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:15:16,786 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 16 treesize of output 18 [2023-01-28 10:15:17,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:15:17,103 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 40 treesize of output 48 [2023-01-28 10:15:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:15:17,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:15:17,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:15:17,816 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 516 treesize of output 528 [2023-01-28 10:15:17,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:15:17,845 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 433 treesize of output 365 [2023-01-28 10:15:17,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:15:17,875 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 304 treesize of output 290 [2023-01-28 10:15:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:15:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113448841] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:15:34,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:15:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 47 [2023-01-28 10:15:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275395686] [2023-01-28 10:15:34,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:15:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-01-28 10:15:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:15:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-01-28 10:15:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1997, Unknown=4, NotChecked=0, Total=2256 [2023-01-28 10:15:34,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 507 [2023-01-28 10:15:34,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 1160 transitions, 13740 flow. Second operand has 48 states, 48 states have (on average 146.89583333333334) internal successors, (7051), 48 states have internal predecessors, (7051), 0 states have call successors, (0), 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 10:15:34,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:15:34,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 507 [2023-01-28 10:15:34,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:15:48,183 INFO L130 PetriNetUnfolder]: 15838/25707 cut-off events. [2023-01-28 10:15:48,183 INFO L131 PetriNetUnfolder]: For 3098102/3098102 co-relation queries the response was YES. [2023-01-28 10:15:48,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252832 conditions, 25707 events. 15838/25707 cut-off events. For 3098102/3098102 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 181858 event pairs, 4347 based on Foata normal form. 374/25185 useless extension candidates. Maximal degree in co-relation 252657. Up to 13654 conditions per place. [2023-01-28 10:15:48,653 INFO L137 encePairwiseOnDemand]: 487/507 looper letters, 836 selfloop transitions, 480 changer transitions 50/1366 dead transitions. [2023-01-28 10:15:48,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 1366 transitions, 19439 flow [2023-01-28 10:15:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-28 10:15:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-01-28 10:15:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6692 transitions. [2023-01-28 10:15:48,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29998206921283843 [2023-01-28 10:15:48,660 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 6692 transitions. [2023-01-28 10:15:48,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 6692 transitions. [2023-01-28 10:15:48,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:15:48,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 6692 transitions. [2023-01-28 10:15:48,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 152.0909090909091) internal successors, (6692), 44 states have internal predecessors, (6692), 0 states have call successors, (0), 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 10:15:48,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 507.0) internal successors, (22815), 45 states have internal predecessors, (22815), 0 states have call successors, (0), 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 10:15:48,689 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 507.0) internal successors, (22815), 45 states have internal predecessors, (22815), 0 states have call successors, (0), 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 10:15:48,689 INFO L175 Difference]: Start difference. First operand has 491 places, 1160 transitions, 13740 flow. Second operand 44 states and 6692 transitions. [2023-01-28 10:15:48,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 1366 transitions, 19439 flow [2023-01-28 10:16:02,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1366 transitions, 16889 flow, removed 1143 selfloop flow, removed 62 redundant places. [2023-01-28 10:16:02,205 INFO L231 Difference]: Finished difference. Result has 469 places, 1062 transitions, 12975 flow [2023-01-28 10:16:02,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=9777, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=12975, PETRI_PLACES=469, PETRI_TRANSITIONS=1062} [2023-01-28 10:16:02,206 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 434 predicate places. [2023-01-28 10:16:02,206 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 1062 transitions, 12975 flow [2023-01-28 10:16:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 146.89583333333334) internal successors, (7051), 48 states have internal predecessors, (7051), 0 states have call successors, (0), 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 10:16:02,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:02,207 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:02,212 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 10:16:02,407 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 10:16:02,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:02,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -861947296, now seen corresponding path program 5 times [2023-01-28 10:16:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922280807] [2023-01-28 10:16:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:16:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922280807] [2023-01-28 10:16:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922280807] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:16:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473561321] [2023-01-28 10:16:03,434 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 10:16:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:16:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:16:03,435 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 10:16:03,436 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 10:16:03,613 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:16:03,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:16:03,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-28 10:16:03,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:16:03,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:16:03,653 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2023-01-28 10:16:03,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 35 [2023-01-28 10:16:03,774 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-28 10:16:03,774 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 16 treesize of output 18 [2023-01-28 10:16:04,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:16:04,028 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 10:16:04,245 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-28 10:16:04,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2023-01-28 10:16:04,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-01-28 10:16:04,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-28 10:16:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:16:04,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:16:04,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:16:04,774 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 262 treesize of output 298 [2023-01-28 10:16:04,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:16:04,807 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 101 treesize of output 111 [2023-01-28 10:16:04,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-01-28 10:16:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:16:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473561321] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:16:07,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:16:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 45 [2023-01-28 10:16:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968593972] [2023-01-28 10:16:07,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:16:07,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-01-28 10:16:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:07,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-01-28 10:16:07,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1886, Unknown=5, NotChecked=0, Total=2070 [2023-01-28 10:16:07,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 507 [2023-01-28 10:16:07,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 1062 transitions, 12975 flow. Second operand has 46 states, 46 states have (on average 135.84782608695653) internal successors, (6249), 46 states have internal predecessors, (6249), 0 states have call successors, (0), 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 10:16:07,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:07,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 507 [2023-01-28 10:16:07,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:34,542 WARN L222 SmtUtils]: Spent 24.46s on a formula simplification. DAG size of input: 102 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:17:12,784 WARN L222 SmtUtils]: Spent 22.49s on a formula simplification. DAG size of input: 112 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:17:15,549 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 10:17:17,559 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 10:17:19,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:17:21,810 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 10:17:44,904 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 10:17:46,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:17:49,195 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 10:17:51,206 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 10:17:53,227 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 10:17:55,238 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 10:17:57,245 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 10:17:59,250 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 10:18:01,254 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 10:18:03,259 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 10:18:05,269 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 10:18:07,287 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 10:18:10,168 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 10:18:12,186 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 10:18:14,214 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 10:18:16,225 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 10:18:19,027 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 10:18:21,848 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 10:18:27,584 INFO L130 PetriNetUnfolder]: 21972/35676 cut-off events. [2023-01-28 10:18:27,585 INFO L131 PetriNetUnfolder]: For 1701654/1701654 co-relation queries the response was YES. [2023-01-28 10:18:28,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302388 conditions, 35676 events. 21972/35676 cut-off events. For 1701654/1701654 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 266560 event pairs, 5968 based on Foata normal form. 98/34642 useless extension candidates. Maximal degree in co-relation 302244. Up to 15178 conditions per place. [2023-01-28 10:18:28,367 INFO L137 encePairwiseOnDemand]: 490/507 looper letters, 1255 selfloop transitions, 873 changer transitions 30/2158 dead transitions. [2023-01-28 10:18:28,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 2158 transitions, 30958 flow [2023-01-28 10:18:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-01-28 10:18:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-01-28 10:18:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 11691 transitions. [2023-01-28 10:18:28,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27782134454979684 [2023-01-28 10:18:28,376 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 11691 transitions. [2023-01-28 10:18:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 11691 transitions. [2023-01-28 10:18:28,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:18:28,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 11691 transitions. [2023-01-28 10:18:28,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 140.85542168674698) internal successors, (11691), 83 states have internal predecessors, (11691), 0 states have call successors, (0), 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 10:18:28,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 507.0) internal successors, (42588), 84 states have internal predecessors, (42588), 0 states have call successors, (0), 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 10:18:28,410 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 507.0) internal successors, (42588), 84 states have internal predecessors, (42588), 0 states have call successors, (0), 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 10:18:28,410 INFO L175 Difference]: Start difference. First operand has 469 places, 1062 transitions, 12975 flow. Second operand 83 states and 11691 transitions. [2023-01-28 10:18:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 2158 transitions, 30958 flow [2023-01-28 10:18:45,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 2158 transitions, 29387 flow, removed 679 selfloop flow, removed 16 redundant places. [2023-01-28 10:18:45,467 INFO L231 Difference]: Finished difference. Result has 572 places, 1550 transitions, 22095 flow [2023-01-28 10:18:45,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=12333, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=22095, PETRI_PLACES=572, PETRI_TRANSITIONS=1550} [2023-01-28 10:18:45,468 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 537 predicate places. [2023-01-28 10:18:45,468 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 1550 transitions, 22095 flow [2023-01-28 10:18:45,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 135.84782608695653) internal successors, (6249), 46 states have internal predecessors, (6249), 0 states have call successors, (0), 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 10:18:45,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:18:45,469 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:18:45,476 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 10:18:45,673 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 10:18:45,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:18:45,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:18:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -906710397, now seen corresponding path program 6 times [2023-01-28 10:18:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:18:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166171977] [2023-01-28 10:18:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:18:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:18:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:18:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:18:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:18:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166171977] [2023-01-28 10:18:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166171977] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:18:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92768298] [2023-01-28 10:18:46,926 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 10:18:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:18:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:18:46,928 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 10:18:46,930 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 10:18:47,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 10:18:47,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:18:47,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-28 10:18:47,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:18:47,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:18:47,391 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 10:18:47,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:18:47,435 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 10:18:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-01-28 10:18:47,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 10:18:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92768298] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:18:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 10:18:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2023-01-28 10:18:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506956303] [2023-01-28 10:18:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:18:47,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 10:18:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:18:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 10:18:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-01-28 10:18:47,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 507 [2023-01-28 10:18:47,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1550 transitions, 22095 flow. Second operand has 9 states, 9 states have (on average 191.22222222222223) internal successors, (1721), 9 states have internal predecessors, (1721), 0 states have call successors, (0), 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 10:18:47,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:18:47,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 507 [2023-01-28 10:18:47,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:19:01,274 INFO L130 PetriNetUnfolder]: 22999/36957 cut-off events. [2023-01-28 10:19:01,275 INFO L131 PetriNetUnfolder]: For 2299524/2299524 co-relation queries the response was YES. [2023-01-28 10:19:02,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343937 conditions, 36957 events. 22999/36957 cut-off events. For 2299524/2299524 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 273194 event pairs, 3283 based on Foata normal form. 76/35791 useless extension candidates. Maximal degree in co-relation 343758. Up to 24671 conditions per place. [2023-01-28 10:19:02,245 INFO L137 encePairwiseOnDemand]: 502/507 looper letters, 1574 selfloop transitions, 138 changer transitions 19/1731 dead transitions. [2023-01-28 10:19:02,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 1731 transitions, 28556 flow [2023-01-28 10:19:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 10:19:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 10:19:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1375 transitions. [2023-01-28 10:19:02,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38743307974077207 [2023-01-28 10:19:02,247 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1375 transitions. [2023-01-28 10:19:02,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1375 transitions. [2023-01-28 10:19:02,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:19:02,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1375 transitions. [2023-01-28 10:19:02,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 0 states have call successors, (0), 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 10:19:02,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 507.0) internal successors, (4056), 8 states have internal predecessors, (4056), 0 states have call successors, (0), 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 10:19:02,250 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 507.0) internal successors, (4056), 8 states have internal predecessors, (4056), 0 states have call successors, (0), 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 10:19:02,250 INFO L175 Difference]: Start difference. First operand has 572 places, 1550 transitions, 22095 flow. Second operand 7 states and 1375 transitions. [2023-01-28 10:19:02,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 1731 transitions, 28556 flow [2023-01-28 10:19:29,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 1731 transitions, 27160 flow, removed 607 selfloop flow, removed 21 redundant places. [2023-01-28 10:19:29,562 INFO L231 Difference]: Finished difference. Result has 552 places, 1514 transitions, 20777 flow [2023-01-28 10:19:29,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=20386, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=20777, PETRI_PLACES=552, PETRI_TRANSITIONS=1514} [2023-01-28 10:19:29,564 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 517 predicate places. [2023-01-28 10:19:29,564 INFO L495 AbstractCegarLoop]: Abstraction has has 552 places, 1514 transitions, 20777 flow [2023-01-28 10:19:29,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 191.22222222222223) internal successors, (1721), 9 states have internal predecessors, (1721), 0 states have call successors, (0), 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 10:19:29,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:19:29,564 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:19:29,569 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 10:19:29,765 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,SelfDestructingSolverStorable15 [2023-01-28 10:19:29,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:19:29,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:19:29,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1876870303, now seen corresponding path program 6 times [2023-01-28 10:19:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:19:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506442391] [2023-01-28 10:19:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:19:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:19:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:19:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 10:19:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:19:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506442391] [2023-01-28 10:19:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506442391] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:19:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:19:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 10:19:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686807778] [2023-01-28 10:19:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:19:29,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:19:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:19:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:19:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:19:29,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 507 [2023-01-28 10:19:29,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 1514 transitions, 20777 flow. Second operand has 5 states, 5 states have (on average 227.2) internal successors, (1136), 5 states have internal predecessors, (1136), 0 states have call successors, (0), 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 10:19:29,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:19:29,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 507 [2023-01-28 10:19:29,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:19:47,736 INFO L130 PetriNetUnfolder]: 32787/51223 cut-off events. [2023-01-28 10:19:47,736 INFO L131 PetriNetUnfolder]: For 3680411/3680411 co-relation queries the response was YES. [2023-01-28 10:19:48,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498792 conditions, 51223 events. 32787/51223 cut-off events. For 3680411/3680411 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 376956 event pairs, 6692 based on Foata normal form. 1924/50171 useless extension candidates. Maximal degree in co-relation 498617. Up to 19236 conditions per place. [2023-01-28 10:19:49,388 INFO L137 encePairwiseOnDemand]: 503/507 looper letters, 1517 selfloop transitions, 199 changer transitions 67/1783 dead transitions. [2023-01-28 10:19:49,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 1783 transitions, 28210 flow [2023-01-28 10:19:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:19:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:19:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 953 transitions. [2023-01-28 10:19:49,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46992110453648916 [2023-01-28 10:19:49,389 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 953 transitions. [2023-01-28 10:19:49,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 953 transitions. [2023-01-28 10:19:49,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:19:49,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 953 transitions. [2023-01-28 10:19:49,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 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 10:19:49,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:19:49,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 507.0) internal successors, (2535), 5 states have internal predecessors, (2535), 0 states have call successors, (0), 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 10:19:49,391 INFO L175 Difference]: Start difference. First operand has 552 places, 1514 transitions, 20777 flow. Second operand 4 states and 953 transitions. [2023-01-28 10:19:49,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 1783 transitions, 28210 flow [2023-01-28 10:20:43,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 1783 transitions, 27101 flow, removed 221 selfloop flow, removed 38 redundant places. [2023-01-28 10:20:43,971 INFO L231 Difference]: Finished difference. Result has 478 places, 1191 transitions, 16574 flow [2023-01-28 10:20:43,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=15732, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=16574, PETRI_PLACES=478, PETRI_TRANSITIONS=1191} [2023-01-28 10:20:43,972 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 443 predicate places. [2023-01-28 10:20:43,972 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 1191 transitions, 16574 flow [2023-01-28 10:20:43,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.2) internal successors, (1136), 5 states have internal predecessors, (1136), 0 states have call successors, (0), 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 10:20:43,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:20:43,973 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:20:43,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 10:20:43,973 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:20:43,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:20:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -784039819, now seen corresponding path program 7 times [2023-01-28 10:20:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:20:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590434921] [2023-01-28 10:20:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:20:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:20:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:20:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:20:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:20:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590434921] [2023-01-28 10:20:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590434921] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:20:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59680413] [2023-01-28 10:20:45,712 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 10:20:45,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:20:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:20:45,713 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 10:20:45,715 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 10:20:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:20:45,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 29 conjunts are in the unsatisfiable core [2023-01-28 10:20:45,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:20:46,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:20:46,125 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 10:20:46,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:20:46,175 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 10:20:46,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:20:46,332 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 44 treesize of output 32 [2023-01-28 10:20:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 10:20:46,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:20:48,607 WARN L839 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (v_ArrVal_928 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_928))) (let ((.cse0 (select .cse1 ~q2~0.base))) (or (< 0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (< (+ (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) 1) (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))))) is different from false [2023-01-28 10:20:48,637 WARN L839 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_928))) (let ((.cse0 (select .cse1 ~q2~0.base))) (or (< (+ (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) 1) (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (< 0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))))))) is different from false [2023-01-28 10:20:48,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:20:48,687 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 1938 treesize of output 1750 [2023-01-28 10:20:48,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:20:48,745 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 406 treesize of output 338 [2023-01-28 10:20:48,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:20:48,780 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 305 treesize of output 291 [2023-01-28 10:20:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 10:20:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59680413] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:20:55,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:20:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18, 12] total 37 [2023-01-28 10:20:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867952720] [2023-01-28 10:20:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:20:55,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 10:20:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:20:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 10:20:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1159, Unknown=2, NotChecked=138, Total=1406 [2023-01-28 10:20:55,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 507 [2023-01-28 10:20:55,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1191 transitions, 16574 flow. Second operand has 11 states, 11 states have (on average 180.8181818181818) internal successors, (1989), 11 states have internal predecessors, (1989), 0 states have call successors, (0), 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 10:20:55,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:20:55,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 507 [2023-01-28 10:20:55,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:20:55,247 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_front~0 4)) (.cse1 (* c_~q2_back~0 4)) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((~q2~0.base Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_928))) (let ((.cse0 (select .cse2 ~q2~0.base))) (or (< (+ (select .cse0 (+ ~q2~0.offset .cse1)) 1) (select (select .cse2 c_~q1~0.base) .cse3)) (< 0 (select .cse0 (+ ~q2~0.offset .cse4))))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q1~0.base)) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse5 (select |c_#memory_int| ~q2~0.base))) (or (< 0 (select .cse5 (+ ~q2~0.offset .cse4))) (< (+ (select .cse5 (+ ~q2~0.offset .cse1)) 1) (select (select |c_#memory_int| c_~q1~0.base) .cse3))))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~q1~0.base)))) is different from false [2023-01-28 10:20:57,400 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 10:20:59,407 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 10:21:02,004 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 10:21:16,497 INFO L130 PetriNetUnfolder]: 32354/50642 cut-off events. [2023-01-28 10:21:16,497 INFO L131 PetriNetUnfolder]: For 1798295/1798295 co-relation queries the response was YES. [2023-01-28 10:21:17,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445100 conditions, 50642 events. 32354/50642 cut-off events. For 1798295/1798295 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 368627 event pairs, 6479 based on Foata normal form. 34/47856 useless extension candidates. Maximal degree in co-relation 444956. Up to 31843 conditions per place. [2023-01-28 10:21:17,474 INFO L137 encePairwiseOnDemand]: 492/507 looper letters, 867 selfloop transitions, 590 changer transitions 0/1457 dead transitions. [2023-01-28 10:21:17,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1457 transitions, 23391 flow [2023-01-28 10:21:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 10:21:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 10:21:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1858 transitions. [2023-01-28 10:21:17,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36646942800788956 [2023-01-28 10:21:17,476 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1858 transitions. [2023-01-28 10:21:17,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1858 transitions. [2023-01-28 10:21:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:21:17,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1858 transitions. [2023-01-28 10:21:17,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 185.8) internal successors, (1858), 10 states have internal predecessors, (1858), 0 states have call successors, (0), 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 10:21:17,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 507.0) internal successors, (5577), 11 states have internal predecessors, (5577), 0 states have call successors, (0), 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 10:21:17,480 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 507.0) internal successors, (5577), 11 states have internal predecessors, (5577), 0 states have call successors, (0), 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 10:21:17,480 INFO L175 Difference]: Start difference. First operand has 478 places, 1191 transitions, 16574 flow. Second operand 10 states and 1858 transitions. [2023-01-28 10:21:17,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1457 transitions, 23391 flow [2023-01-28 10:21:36,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1457 transitions, 22686 flow, removed 257 selfloop flow, removed 11 redundant places. [2023-01-28 10:21:36,405 INFO L231 Difference]: Finished difference. Result has 462 places, 1377 transitions, 21462 flow [2023-01-28 10:21:36,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=16031, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=406, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21462, PETRI_PLACES=462, PETRI_TRANSITIONS=1377} [2023-01-28 10:21:36,406 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 427 predicate places. [2023-01-28 10:21:36,406 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 1377 transitions, 21462 flow [2023-01-28 10:21:36,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 180.8181818181818) internal successors, (1989), 11 states have internal predecessors, (1989), 0 states have call successors, (0), 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 10:21:36,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:21:36,407 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:21:36,414 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 10:21:36,607 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 10:21:36,607 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:21:36,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:21:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 949483153, now seen corresponding path program 8 times [2023-01-28 10:21:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:21:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010014976] [2023-01-28 10:21:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:21:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:21:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:21:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:21:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:21:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010014976] [2023-01-28 10:21:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010014976] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:21:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136796139] [2023-01-28 10:21:38,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:21:38,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:21:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:21:38,432 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:21:38,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 10:21:38,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:21:38,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:21:38,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-28 10:21:38,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:21:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:21:38,955 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 10:21:39,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-28 10:21:39,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-28 10:21:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-28 10:21:39,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:21:39,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:21:39,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2023-01-28 10:21:39,339 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~q2_front~0 c_~q2_back~0) (forall ((v_ArrVal_1001 (Array Int Int))) (<= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1001) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2023-01-28 10:21:39,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:21:39,350 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 46 treesize of output 38 [2023-01-28 10:21:39,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-01-28 10:21:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 10:21:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136796139] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:21:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:21:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 11] total 33 [2023-01-28 10:21:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792004943] [2023-01-28 10:21:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:21:39,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 10:21:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:21:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 10:21:39,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=968, Unknown=1, NotChecked=62, Total=1122 [2023-01-28 10:21:39,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 507 [2023-01-28 10:21:39,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1377 transitions, 21462 flow. Second operand has 10 states, 10 states have (on average 184.1) internal successors, (1841), 10 states have internal predecessors, (1841), 0 states have call successors, (0), 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 10:21:39,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:21:39,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 507 [2023-01-28 10:21:39,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:21:56,459 INFO L130 PetriNetUnfolder]: 32452/50956 cut-off events. [2023-01-28 10:21:56,460 INFO L131 PetriNetUnfolder]: For 1792914/1792914 co-relation queries the response was YES. [2023-01-28 10:21:57,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457498 conditions, 50956 events. 32452/50956 cut-off events. For 1792914/1792914 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 376843 event pairs, 6583 based on Foata normal form. 58/48194 useless extension candidates. Maximal degree in co-relation 457358. Up to 30912 conditions per place. [2023-01-28 10:21:57,733 INFO L137 encePairwiseOnDemand]: 492/507 looper letters, 797 selfloop transitions, 712 changer transitions 0/1509 dead transitions. [2023-01-28 10:21:57,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1509 transitions, 26365 flow [2023-01-28 10:21:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 10:21:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 10:21:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1885 transitions. [2023-01-28 10:21:57,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2023-01-28 10:21:57,735 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1885 transitions. [2023-01-28 10:21:57,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1885 transitions. [2023-01-28 10:21:57,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:21:57,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1885 transitions. [2023-01-28 10:21:57,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 188.5) internal successors, (1885), 10 states have internal predecessors, (1885), 0 states have call successors, (0), 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 10:21:57,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 507.0) internal successors, (5577), 11 states have internal predecessors, (5577), 0 states have call successors, (0), 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 10:21:57,738 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 507.0) internal successors, (5577), 11 states have internal predecessors, (5577), 0 states have call successors, (0), 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 10:21:57,738 INFO L175 Difference]: Start difference. First operand has 462 places, 1377 transitions, 21462 flow. Second operand 10 states and 1885 transitions. [2023-01-28 10:21:57,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1509 transitions, 26365 flow [2023-01-28 10:22:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1509 transitions, 26033 flow, removed 97 selfloop flow, removed 5 redundant places. [2023-01-28 10:22:21,448 INFO L231 Difference]: Finished difference. Result has 471 places, 1433 transitions, 24885 flow [2023-01-28 10:22:21,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=21139, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=657, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24885, PETRI_PLACES=471, PETRI_TRANSITIONS=1433} [2023-01-28 10:22:21,449 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 436 predicate places. [2023-01-28 10:22:21,449 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 1433 transitions, 24885 flow [2023-01-28 10:22:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 184.1) internal successors, (1841), 10 states have internal predecessors, (1841), 0 states have call successors, (0), 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 10:22:21,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:22:21,450 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:22:21,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 10:22:21,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:22:21,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:22:21,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:22:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1299775712, now seen corresponding path program 9 times [2023-01-28 10:22:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:22:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582780004] [2023-01-28 10:22:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:22:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:22:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:22:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:22:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:22:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582780004] [2023-01-28 10:22:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582780004] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:22:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73722937] [2023-01-28 10:22:23,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:22:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:22:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:22:23,373 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:22:23,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 10:22:23,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:22:23,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:22:23,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 10:22:23,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:22:24,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:24,240 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 10:22:24,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:24,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:24,514 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 10:22:24,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2023-01-28 10:22:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-28 10:22:24,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:22:25,420 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2023-01-28 10:22:25,421 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 668 treesize of output 712 [2023-01-28 10:22:25,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:22:25,460 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 450 treesize of output 358 [2023-01-28 10:22:25,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:22:25,529 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 407 treesize of output 411 [2023-01-28 10:22:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-28 10:22:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73722937] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:22:46,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:22:46,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 44 [2023-01-28 10:22:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115623703] [2023-01-28 10:22:46,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:22:46,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-01-28 10:22:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:22:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-01-28 10:22:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1797, Unknown=15, NotChecked=0, Total=1980 [2023-01-28 10:22:46,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 507 [2023-01-28 10:22:46,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1433 transitions, 24885 flow. Second operand has 45 states, 45 states have (on average 143.95555555555555) internal successors, (6478), 45 states have internal predecessors, (6478), 0 states have call successors, (0), 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 10:22:46,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:22:46,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 507 [2023-01-28 10:22:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:23:13,472 WARN L222 SmtUtils]: Spent 19.45s on a formula simplification. DAG size of input: 143 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:23:42,150 WARN L222 SmtUtils]: Spent 21.69s on a formula simplification. DAG size of input: 151 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:23:44,163 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 10:23:46,178 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 10:23:48,182 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 10:23:50,203 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 10:23:52,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:23:58,542 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 10:24:00,656 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 10:24:20,328 WARN L222 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 134 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:25:00,513 WARN L222 SmtUtils]: Spent 29.15s on a formula simplification. DAG size of input: 142 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:25:02,520 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 10:25:04,528 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 10:25:06,543 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 10:25:08,554 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] Received shutdown request... [2023-01-28 10:25:16,464 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 10:25:16,464 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 10:25:17,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 10:25:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-28 10:25:17,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-28 10:25:17,565 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-28 10:25:17,568 INFO L158 Benchmark]: Toolchain (without parser) took 828576.53ms. Allocated memory was 356.5MB in the beginning and 11.1GB in the end (delta: 10.7GB). Free memory was 325.3MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-01-28 10:25:17,568 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 10:25:17,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.27ms. Allocated memory is still 356.5MB. Free memory was 325.3MB in the beginning and 312.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 10:25:17,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.24ms. Allocated memory is still 356.5MB. Free memory was 312.7MB in the beginning and 310.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:25:17,568 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 356.5MB. Free memory was 310.2MB in the beginning and 308.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:25:17,569 INFO L158 Benchmark]: RCFGBuilder took 560.29ms. Allocated memory is still 356.5MB. Free memory was 308.1MB in the beginning and 264.4MB in the end (delta: 43.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-01-28 10:25:17,569 INFO L158 Benchmark]: TraceAbstraction took 827671.33ms. Allocated memory was 356.5MB in the beginning and 11.1GB in the end (delta: 10.7GB). Free memory was 264.0MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-01-28 10:25:17,569 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.51ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 249.27ms. Allocated memory is still 356.5MB. Free memory was 325.3MB in the beginning and 312.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.24ms. Allocated memory is still 356.5MB. Free memory was 312.7MB in the beginning and 310.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 356.5MB. Free memory was 310.2MB in the beginning and 308.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 560.29ms. Allocated memory is still 356.5MB. Free memory was 308.1MB in the beginning and 264.4MB in the end (delta: 43.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 827671.33ms. Allocated memory was 356.5MB in the beginning and 11.1GB in the end (delta: 10.7GB). Free memory was 264.0MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 230 PlacesBefore, 35 PlacesAfterwards, 242 TransitionsBefore, 33 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 160 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 12 ConcurrentYvCompositions, 14 ChoiceCompositions, 252 TotalNumberOfCompositions, 3161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2304, independent: 2216, independent conditional: 0, independent unconditional: 2216, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1112, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2304, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown