/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:37:13,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:37:13,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:37:13,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:37:13,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:37:13,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:37:13,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:37:13,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:37:13,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:37:13,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:37:13,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:37:13,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:37:13,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:37:13,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:37:13,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:37:13,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:37:13,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:37:13,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:37:13,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:37:13,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:37:13,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:37:13,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:37:13,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:37:13,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:37:13,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:37:13,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:37:13,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:37:13,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:37:13,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:37:13,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:37:13,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:37:13,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:37:13,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:37:13,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:37:13,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:37:13,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:37:13,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:37:13,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:37:13,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:37:13,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:37:13,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:37:13,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 11:37:13,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:37:13,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:37:13,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:37:13,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:37:13,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:37:13,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:37:13,503 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:37:13,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:37:13,503 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:37:13,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:37:13,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:37:13,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:37:13,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:37:13,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:37:13,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:37:13,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:37:13,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:37:13,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:37:13,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:37:13,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:37:13,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:37:13,810 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:37:13,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-12 11:37:14,844 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:37:15,093 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:37:15,093 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-12 11:37:15,113 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094a46560/49d63ef5f1c94db8a8996d84efa18229/FLAG1a95e2ebf [2022-12-12 11:37:15,126 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094a46560/49d63ef5f1c94db8a8996d84efa18229 [2022-12-12 11:37:15,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:37:15,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:37:15,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:37:15,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:37:15,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:37:15,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a59d69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15, skipping insertion in model container [2022-12-12 11:37:15,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:37:15,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:37:15,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-12 11:37:15,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:37:15,495 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:37:15,526 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-12 11:37:15,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:37:15,580 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:37:15,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15 WrapperNode [2022-12-12 11:37:15,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:37:15,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:37:15,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:37:15,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:37:15,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,630 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-12 11:37:15,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:37:15,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:37:15,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:37:15,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:37:15,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:37:15,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:37:15,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:37:15,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:37:15,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (1/1) ... [2022-12-12 11:37:15,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:37:15,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:37:15,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 11:37:15,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 11:37:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 11:37:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 11:37:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:37:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:37:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:37:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:37:15,717 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:37:15,812 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:37:15,814 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:37:16,031 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:37:16,038 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:37:16,038 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 11:37:16,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:37:16 BoogieIcfgContainer [2022-12-12 11:37:16,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:37:16,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:37:16,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:37:16,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:37:16,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:37:15" (1/3) ... [2022-12-12 11:37:16,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a332f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:37:16, skipping insertion in model container [2022-12-12 11:37:16,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:37:15" (2/3) ... [2022-12-12 11:37:16,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a332f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:37:16, skipping insertion in model container [2022-12-12 11:37:16,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:37:16" (3/3) ... [2022-12-12 11:37:16,061 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2022-12-12 11:37:16,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:37:16,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:37:16,074 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:37:16,160 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 11:37:16,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-12 11:37:16,238 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-12 11:37:16,238 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 11:37:16,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 155 events. 10/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 368 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-12 11:37:16,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-12 11:37:16,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-12 11:37:16,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:37:16,278 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;@4b92ee10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:37:16,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:37:16,299 INFO L130 PetriNetUnfolder]: 4/112 cut-off events. [2022-12-12 11:37:16,300 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 11:37:16,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:16,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:16,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -256178398, now seen corresponding path program 1 times [2022-12-12 11:37:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911968934] [2022-12-12 11:37:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:16,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:16,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911968934] [2022-12-12 11:37:16,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911968934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:16,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:16,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:37:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671828062] [2022-12-12 11:37:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:16,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:37:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:37:16,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:37:16,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 157 [2022-12-12 11:37:16,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:16,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:16,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 157 [2022-12-12 11:37:16,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:16,867 INFO L130 PetriNetUnfolder]: 91/770 cut-off events. [2022-12-12 11:37:16,867 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-12 11:37:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 770 events. 91/770 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4567 event pairs, 15 based on Foata normal form. 62/761 useless extension candidates. Maximal degree in co-relation 795. Up to 96 conditions per place. [2022-12-12 11:37:16,877 INFO L137 encePairwiseOnDemand]: 148/157 looper letters, 19 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2022-12-12 11:37:16,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 351 flow [2022-12-12 11:37:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:37:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:37:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-12-12 11:37:16,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2022-12-12 11:37:16,896 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, -2 predicate places. [2022-12-12 11:37:16,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 146 transitions, 351 flow [2022-12-12 11:37:16,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 146 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 11:37:16,902 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 146 transitions, 341 flow [2022-12-12 11:37:16,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:16,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:16,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:16,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:37:16,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1900615017, now seen corresponding path program 1 times [2022-12-12 11:37:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768096418] [2022-12-12 11:37:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768096418] [2022-12-12 11:37:17,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768096418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:17,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:37:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089258084] [2022-12-12 11:37:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:37:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:37:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:37:17,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 157 [2022-12-12 11:37:17,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 146 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:17,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:17,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 157 [2022-12-12 11:37:17,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:17,152 INFO L130 PetriNetUnfolder]: 65/569 cut-off events. [2022-12-12 11:37:17,152 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-12 11:37:17,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 569 events. 65/569 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2676 event pairs, 29 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 464. Up to 80 conditions per place. [2022-12-12 11:37:17,155 INFO L137 encePairwiseOnDemand]: 154/157 looper letters, 10 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2022-12-12 11:37:17,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 146 transitions, 363 flow [2022-12-12 11:37:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:37:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:37:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-12-12 11:37:17,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9299363057324841 [2022-12-12 11:37:17,159 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, -3 predicate places. [2022-12-12 11:37:17,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 146 transitions, 363 flow [2022-12-12 11:37:17,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 361 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 11:37:17,164 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 146 transitions, 361 flow [2022-12-12 11:37:17,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:17,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:17,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:17,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:37:17,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 273147365, now seen corresponding path program 1 times [2022-12-12 11:37:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489041751] [2022-12-12 11:37:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:17,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489041751] [2022-12-12 11:37:17,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489041751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:17,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:17,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 11:37:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262579533] [2022-12-12 11:37:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:17,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 11:37:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 11:37:17,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 11:37:17,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 157 [2022-12-12 11:37:17,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 146 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:17,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:17,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 157 [2022-12-12 11:37:17,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:17,383 INFO L130 PetriNetUnfolder]: 98/743 cut-off events. [2022-12-12 11:37:17,384 INFO L131 PetriNetUnfolder]: For 189/192 co-relation queries the response was YES. [2022-12-12 11:37:17,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 743 events. 98/743 cut-off events. For 189/192 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4098 event pairs, 36 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 675. Up to 114 conditions per place. [2022-12-12 11:37:17,388 INFO L137 encePairwiseOnDemand]: 152/157 looper letters, 21 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2022-12-12 11:37:17,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 156 transitions, 460 flow [2022-12-12 11:37:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 11:37:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 11:37:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2022-12-12 11:37:17,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9060509554140127 [2022-12-12 11:37:17,391 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-12-12 11:37:17,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 156 transitions, 460 flow [2022-12-12 11:37:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 156 transitions, 458 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 11:37:17,396 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 156 transitions, 458 flow [2022-12-12 11:37:17,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:17,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:17,397 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:37:17,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2022064704, now seen corresponding path program 1 times [2022-12-12 11:37:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:17,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867553608] [2022-12-12 11:37:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:17,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867553608] [2022-12-12 11:37:17,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867553608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:37:17,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452571610] [2022-12-12 11:37:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:37:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:37:17,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 11:37:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 11:37:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-12 11:37:17,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:37:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:17,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:37:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:17,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452571610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:37:17,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:37:17,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-12 11:37:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634596973] [2022-12-12 11:37:17,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:37:17,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:37:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:17,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:37:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:37:17,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2022-12-12 11:37:17,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 156 transitions, 458 flow. Second operand has 10 states, 10 states have (on average 136.5) internal successors, (1365), 10 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:17,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:17,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2022-12-12 11:37:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:18,143 INFO L130 PetriNetUnfolder]: 224/1530 cut-off events. [2022-12-12 11:37:18,143 INFO L131 PetriNetUnfolder]: For 617/673 co-relation queries the response was YES. [2022-12-12 11:37:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 1530 events. 224/1530 cut-off events. For 617/673 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10159 event pairs, 33 based on Foata normal form. 6/1404 useless extension candidates. Maximal degree in co-relation 1832. Up to 267 conditions per place. [2022-12-12 11:37:18,149 INFO L137 encePairwiseOnDemand]: 151/157 looper letters, 57 selfloop transitions, 14 changer transitions 0/200 dead transitions. [2022-12-12 11:37:18,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 200 transitions, 828 flow [2022-12-12 11:37:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:37:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:37:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1404 transitions. [2022-12-12 11:37:18,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8942675159235669 [2022-12-12 11:37:18,152 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-12-12 11:37:18,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 200 transitions, 828 flow [2022-12-12 11:37:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 200 transitions, 694 flow, removed 65 selfloop flow, removed 2 redundant places. [2022-12-12 11:37:18,154 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 200 transitions, 694 flow [2022-12-12 11:37:18,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.5) internal successors, (1365), 10 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:18,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:18,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:18,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 11:37:18,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:37:18,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1923676378, now seen corresponding path program 1 times [2022-12-12 11:37:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131896612] [2022-12-12 11:37:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:18,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131896612] [2022-12-12 11:37:18,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131896612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:18,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:18,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:37:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398044622] [2022-12-12 11:37:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:18,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:37:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:37:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:37:18,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 157 [2022-12-12 11:37:18,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 200 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:18,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:18,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 157 [2022-12-12 11:37:18,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:18,554 INFO L130 PetriNetUnfolder]: 123/970 cut-off events. [2022-12-12 11:37:18,555 INFO L131 PetriNetUnfolder]: For 716/716 co-relation queries the response was YES. [2022-12-12 11:37:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 970 events. 123/970 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5026 event pairs, 1 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 1041. Up to 112 conditions per place. [2022-12-12 11:37:18,558 INFO L137 encePairwiseOnDemand]: 153/157 looper letters, 39 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2022-12-12 11:37:18,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 196 transitions, 819 flow [2022-12-12 11:37:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:37:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:37:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-12-12 11:37:18,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8980891719745223 [2022-12-12 11:37:18,561 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 8 predicate places. [2022-12-12 11:37:18,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 196 transitions, 819 flow [2022-12-12 11:37:18,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 196 transitions, 781 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-12 11:37:18,563 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 196 transitions, 781 flow [2022-12-12 11:37:18,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:18,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:18,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:37:18,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 8170892, now seen corresponding path program 1 times [2022-12-12 11:37:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:18,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509199744] [2022-12-12 11:37:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509199744] [2022-12-12 11:37:18,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509199744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:18,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:18,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:37:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867741212] [2022-12-12 11:37:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:18,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:37:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:37:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:37:18,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 157 [2022-12-12 11:37:18,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 196 transitions, 781 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:18,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:18,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 157 [2022-12-12 11:37:18,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:18,829 INFO L130 PetriNetUnfolder]: 179/1113 cut-off events. [2022-12-12 11:37:18,829 INFO L131 PetriNetUnfolder]: For 1718/1718 co-relation queries the response was YES. [2022-12-12 11:37:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1113 events. 179/1113 cut-off events. For 1718/1718 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6290 event pairs, 17 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 1641. Up to 205 conditions per place. [2022-12-12 11:37:18,833 INFO L137 encePairwiseOnDemand]: 146/157 looper letters, 88 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2022-12-12 11:37:18,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 221 transitions, 1135 flow [2022-12-12 11:37:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:37:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:37:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1173 transitions. [2022-12-12 11:37:18,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8301486199575372 [2022-12-12 11:37:18,836 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2022-12-12 11:37:18,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 221 transitions, 1135 flow [2022-12-12 11:37:18,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 221 transitions, 1075 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-12 11:37:18,839 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 221 transitions, 1075 flow [2022-12-12 11:37:18,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:18,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:18,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:18,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:37:18,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -876595377, now seen corresponding path program 1 times [2022-12-12 11:37:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:18,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769086829] [2022-12-12 11:37:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:19,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769086829] [2022-12-12 11:37:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769086829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:19,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-12-12 11:37:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455975320] [2022-12-12 11:37:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 11:37:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 11:37:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-12-12 11:37:19,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 157 [2022-12-12 11:37:19,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 221 transitions, 1075 flow. Second operand has 24 states, 24 states have (on average 85.41666666666667) internal successors, (2050), 24 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:19,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:19,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 157 [2022-12-12 11:37:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:21,517 INFO L130 PetriNetUnfolder]: 1117/3614 cut-off events. [2022-12-12 11:37:21,517 INFO L131 PetriNetUnfolder]: For 5515/5519 co-relation queries the response was YES. [2022-12-12 11:37:21,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 3614 events. 1117/3614 cut-off events. For 5515/5519 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 25905 event pairs, 92 based on Foata normal form. 1/3419 useless extension candidates. Maximal degree in co-relation 5101. Up to 1590 conditions per place. [2022-12-12 11:37:21,534 INFO L137 encePairwiseOnDemand]: 123/157 looper letters, 307 selfloop transitions, 43 changer transitions 2/433 dead transitions. [2022-12-12 11:37:21,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 433 transitions, 2755 flow [2022-12-12 11:37:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-12 11:37:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-12 11:37:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2833 transitions. [2022-12-12 11:37:21,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5820834189439079 [2022-12-12 11:37:21,540 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 43 predicate places. [2022-12-12 11:37:21,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 433 transitions, 2755 flow [2022-12-12 11:37:21,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 433 transitions, 2423 flow, removed 164 selfloop flow, removed 2 redundant places. [2022-12-12 11:37:21,549 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 433 transitions, 2423 flow [2022-12-12 11:37:21,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 85.41666666666667) internal successors, (2050), 24 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:21,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:21,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:21,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:37:21,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash 268476563, now seen corresponding path program 2 times [2022-12-12 11:37:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811195465] [2022-12-12 11:37:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811195465] [2022-12-12 11:37:22,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811195465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:22,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:22,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-12 11:37:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174470953] [2022-12-12 11:37:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:22,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 11:37:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 11:37:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2022-12-12 11:37:22,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 157 [2022-12-12 11:37:22,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 433 transitions, 2423 flow. Second operand has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:22,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:22,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 157 [2022-12-12 11:37:22,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:24,728 INFO L130 PetriNetUnfolder]: 1396/4571 cut-off events. [2022-12-12 11:37:24,728 INFO L131 PetriNetUnfolder]: For 6931/6993 co-relation queries the response was YES. [2022-12-12 11:37:24,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14397 conditions, 4571 events. 1396/4571 cut-off events. For 6931/6993 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 35155 event pairs, 231 based on Foata normal form. 15/4327 useless extension candidates. Maximal degree in co-relation 6339. Up to 2210 conditions per place. [2022-12-12 11:37:24,753 INFO L137 encePairwiseOnDemand]: 121/157 looper letters, 449 selfloop transitions, 62 changer transitions 5/589 dead transitions. [2022-12-12 11:37:24,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 589 transitions, 4521 flow [2022-12-12 11:37:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 11:37:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 11:37:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2530 transitions. [2022-12-12 11:37:24,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5035828025477707 [2022-12-12 11:37:24,760 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 72 predicate places. [2022-12-12 11:37:24,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 589 transitions, 4521 flow [2022-12-12 11:37:24,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 589 transitions, 3663 flow, removed 413 selfloop flow, removed 14 redundant places. [2022-12-12 11:37:24,778 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 589 transitions, 3663 flow [2022-12-12 11:37:24,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 73.27586206896552) internal successors, (2125), 29 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:24,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:24,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:24,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:37:24,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 531339751, now seen corresponding path program 3 times [2022-12-12 11:37:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:24,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274071635] [2022-12-12 11:37:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274071635] [2022-12-12 11:37:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274071635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:37:25,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:37:25,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-12 11:37:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473133937] [2022-12-12 11:37:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:37:25,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-12 11:37:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-12 11:37:25,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-12-12 11:37:25,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 157 [2022-12-12 11:37:25,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 589 transitions, 3663 flow. Second operand has 22 states, 22 states have (on average 94.0909090909091) internal successors, (2070), 22 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:25,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:25,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 157 [2022-12-12 11:37:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:27,311 INFO L130 PetriNetUnfolder]: 1850/6059 cut-off events. [2022-12-12 11:37:27,311 INFO L131 PetriNetUnfolder]: For 10208/10290 co-relation queries the response was YES. [2022-12-12 11:37:27,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18505 conditions, 6059 events. 1850/6059 cut-off events. For 10208/10290 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 49265 event pairs, 174 based on Foata normal form. 10/5709 useless extension candidates. Maximal degree in co-relation 9848. Up to 2585 conditions per place. [2022-12-12 11:37:27,341 INFO L137 encePairwiseOnDemand]: 135/157 looper letters, 433 selfloop transitions, 52 changer transitions 9/713 dead transitions. [2022-12-12 11:37:27,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 713 transitions, 5491 flow [2022-12-12 11:37:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-12 11:37:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-12 11:37:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2118 transitions. [2022-12-12 11:37:27,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424021838034577 [2022-12-12 11:37:27,345 INFO L295 CegarLoopForPetriNet]: 143 programPoint places, 78 predicate places. [2022-12-12 11:37:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 713 transitions, 5491 flow [2022-12-12 11:37:27,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 713 transitions, 5096 flow, removed 188 selfloop flow, removed 10 redundant places. [2022-12-12 11:37:27,360 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 713 transitions, 5096 flow [2022-12-12 11:37:27,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 94.0909090909091) internal successors, (2070), 22 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:37:27,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:27,362 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:27,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:37:27,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 11:37:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash -216638997, now seen corresponding path program 1 times [2022-12-12 11:37:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:27,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518917597] [2022-12-12 11:37:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:37:27,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:37:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:37:27,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:37:27,432 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:37:27,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:37:27,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-12 11:37:27,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:37:27,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-12 11:37:27,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-12 11:37:27,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:37:27,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:37:27,434 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:37:27,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:37:27,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:37:27,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:37:27 BasicIcfg [2022-12-12 11:37:27,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:37:27,515 INFO L158 Benchmark]: Toolchain (without parser) took 12386.24ms. Allocated memory was 192.9MB in the beginning and 375.4MB in the end (delta: 182.5MB). Free memory was 166.9MB in the beginning and 133.6MB in the end (delta: 33.3MB). Peak memory consumption was 216.3MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,515 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:37:27,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.99ms. Allocated memory is still 192.9MB. Free memory was 166.9MB in the beginning and 138.1MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 134.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,516 INFO L158 Benchmark]: Boogie Preprocessor took 34.75ms. Allocated memory is still 192.9MB. Free memory was 134.9MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,516 INFO L158 Benchmark]: RCFGBuilder took 373.68ms. Allocated memory is still 192.9MB. Free memory was 133.4MB in the beginning and 116.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,516 INFO L158 Benchmark]: TraceAbstraction took 11472.83ms. Allocated memory was 192.9MB in the beginning and 375.4MB in the end (delta: 182.5MB). Free memory was 115.0MB in the beginning and 133.6MB in the end (delta: -18.6MB). Peak memory consumption was 164.9MB. Max. memory is 8.0GB. [2022-12-12 11:37:27,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.99ms. Allocated memory is still 192.9MB. Free memory was 166.9MB in the beginning and 138.1MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 134.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.75ms. Allocated memory is still 192.9MB. Free memory was 134.9MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 373.68ms. Allocated memory is still 192.9MB. Free memory was 133.4MB in the beginning and 116.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11472.83ms. Allocated memory was 192.9MB in the beginning and 375.4MB in the end (delta: 182.5MB). Free memory was 115.0MB in the beginning and 133.6MB in the end (delta: -18.6MB). Peak memory consumption was 164.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(400)]; VAL [arr={3:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={3:0}, m={4:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1019] 0 pthread_t id1, id2; VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, top=0] [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=398, top=0] [L988] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L989] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, m={4:0}, top=0] [L990] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=399, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967695, arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, tmp=399, top=0] [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=0, m={4:0}, top=0] [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; VAL [\result=0, arr={3:0}, flag=0, m={4:0}, top=0] [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x VAL [\old(x)=399, arr={3:0}, flag=0, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=399] [L968] CALL 1 inc_top() [L944] 1 top++ VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(x)=399, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=399] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, push(arr,tmp)=0, tmp=399, top=1] [L997] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1004] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, m={4:0}, top=1] [L1005] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1005] COND TRUE 2 i<(400) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=1, \result=0, arr={3:0}, flag=1, m={4:0}, top=1] [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, get_top()=1, m={4:0}, stack={3:0}, stack={3:0}, top=1] [L981] CALL 2 dec_top() [L948] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, stack[get_top()]=399, top=0] [L982] 2 return stack[get_top()]; VAL [\result=399, arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, stack[get_top()]=399, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, pop(arr)=399, top=0] [L1005] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 VAL [arr={3:0}, flag=1, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L977] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, pop(arr)=-2, top=0] [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 940]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1253 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1253 mSDsluCounter, 2524 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2312 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4582 IncrementalHoareTripleChecker+Invalid, 4625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 212 mSDtfsCounter, 4582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5096occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1831 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 930 ConstructedInterpolants, 0 QuantifiedInterpolants, 7552 SizeOfPredicates, 2 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 9/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 11:37:27,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...