/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:09:21,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:09:21,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:09:21,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:09:21,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:09:21,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:09:21,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:09:21,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:09:21,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:09:21,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:09:21,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:09:21,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:09:21,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:09:21,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:09:21,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:09:21,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:09:21,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:09:21,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:09:21,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:09:21,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:09:21,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:09:21,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:09:21,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:09:21,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:09:21,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:09:21,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:09:21,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:09:21,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:09:21,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:09:21,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:09:21,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:09:21,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:09:21,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:09:21,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:09:21,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:09:21,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:09:21,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:09:21,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:09:21,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:09:21,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:09:21,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:09:21,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:09:21,699 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:09:21,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:09:21,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:09:21,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:09:21,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:09:21,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:09:21,701 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:09:21,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:09:21,701 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:09:21,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:09:21,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:09:21,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:09:21,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:09:21,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:09:21,703 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:09:21,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:09:21,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:09:21,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:09:21,884 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:09:21,884 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:09:21,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:09:22,903 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:09:23,130 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:09:23,130 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:09:23,144 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f93514e/ffc6dc4474544c56a07a95c9078bcfce/FLAG24c72ab16 [2023-01-27 18:09:23,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f93514e/ffc6dc4474544c56a07a95c9078bcfce [2023-01-27 18:09:23,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:09:23,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:09:23,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:09:23,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:09:23,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:09:23,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd61f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23, skipping insertion in model container [2023-01-27 18:09:23,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:09:23,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:09:23,296 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-01-27 18:09:23,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:09:23,465 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:09:23,475 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-01-27 18:09:23,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:09:23,533 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:09:23,534 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:09:23,538 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:09:23,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23 WrapperNode [2023-01-27 18:09:23,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:09:23,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:09:23,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:09:23,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:09:23,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,581 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-01-27 18:09:23,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:09:23,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:09:23,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:09:23,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:09:23,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:09:23,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:09:23,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:09:23,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:09:23,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (1/1) ... [2023-01-27 18:09:23,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:09:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:09:23,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:09:23,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:09:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:09:23,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:09:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:09:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:09:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:09:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:09:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:09:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:09:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:09:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:09:23,668 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:09:23,834 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:09:23,836 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:09:24,069 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:09:24,180 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:09:24,181 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:09:24,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:09:24 BoogieIcfgContainer [2023-01-27 18:09:24,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:09:24,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:09:24,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:09:24,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:09:24,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:09:23" (1/3) ... [2023-01-27 18:09:24,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0b3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:09:24, skipping insertion in model container [2023-01-27 18:09:24,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:09:23" (2/3) ... [2023-01-27 18:09:24,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0b3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:09:24, skipping insertion in model container [2023-01-27 18:09:24,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:09:24" (3/3) ... [2023-01-27 18:09:24,188 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:09:24,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:09:24,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:09:24,200 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:09:24,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:09:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2023-01-27 18:09:24,348 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-01-27 18:09:24,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:24,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:09:24,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2023-01-27 18:09:24,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-01-27 18:09:24,360 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:09:24,370 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-01-27 18:09:24,371 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-01-27 18:09:24,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-01-27 18:09:24,385 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-01-27 18:09:24,385 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:24,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:09:24,388 INFO L119 LiptonReduction]: Number of co-enabled transitions 2112 [2023-01-27 18:09:26,814 INFO L134 LiptonReduction]: Checked pairs total: 6052 [2023-01-27 18:09:26,814 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-27 18:09:26,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:09:26,842 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;@26f3939f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:09:26,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:09:26,845 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:09:26,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:09:26,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:26,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:09:26,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:26,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash 457006271, now seen corresponding path program 1 times [2023-01-27 18:09:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69091861] [2023-01-27 18:09:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69091861] [2023-01-27 18:09:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69091861] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:09:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952643810] [2023-01-27 18:09:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:27,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:09:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:09:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:09:27,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 208 [2023-01-27 18:09:27,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:27,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 208 [2023-01-27 18:09:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:27,521 INFO L130 PetriNetUnfolder]: 1279/2000 cut-off events. [2023-01-27 18:09:27,522 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-01-27 18:09:27,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 2000 events. 1279/2000 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9762 event pairs, 354 based on Foata normal form. 80/1905 useless extension candidates. Maximal degree in co-relation 3936. Up to 1516 conditions per place. [2023-01-27 18:09:27,532 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-01-27 18:09:27,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 166 flow [2023-01-27 18:09:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:09:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:09:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-01-27 18:09:27,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2023-01-27 18:09:27,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-01-27 18:09:27,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-01-27 18:09:27,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-01-27 18:09:27,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,551 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 340 transitions. [2023-01-27 18:09:27,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 166 flow [2023-01-27 18:09:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:09:27,554 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-01-27 18:09:27,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-01-27 18:09:27,557 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-01-27 18:09:27,557 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-01-27 18:09:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:27,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:09:27,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:27,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash 877000173, now seen corresponding path program 1 times [2023-01-27 18:09:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374796042] [2023-01-27 18:09:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374796042] [2023-01-27 18:09:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374796042] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:27,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:09:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140946008] [2023-01-27 18:09:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:27,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:27,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:09:27,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:27,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:27,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:09:27,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:28,241 INFO L130 PetriNetUnfolder]: 2935/4398 cut-off events. [2023-01-27 18:09:28,242 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-01-27 18:09:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9066 conditions, 4398 events. 2935/4398 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22340 event pairs, 843 based on Foata normal form. 234/4632 useless extension candidates. Maximal degree in co-relation 9056. Up to 2607 conditions per place. [2023-01-27 18:09:28,261 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 36 selfloop transitions, 7 changer transitions 27/70 dead transitions. [2023-01-27 18:09:28,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 70 transitions, 300 flow [2023-01-27 18:09:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:09:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:09:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-27 18:09:28,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-01-27 18:09:28,266 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-27 18:09:28,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-27 18:09:28,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:28,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-27 18:09:28,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,271 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,272 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 512 transitions. [2023-01-27 18:09:28,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 70 transitions, 300 flow [2023-01-27 18:09:28,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 70 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:28,274 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2023-01-27 18:09:28,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-01-27 18:09:28,274 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-01-27 18:09:28,275 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 122 flow [2023-01-27 18:09:28,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:28,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:28,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:09:28,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:28,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1417189263, now seen corresponding path program 1 times [2023-01-27 18:09:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:28,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368739533] [2023-01-27 18:09:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368739533] [2023-01-27 18:09:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368739533] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:28,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553789495] [2023-01-27 18:09:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:28,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:09:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:09:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:09:28,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:09:28,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:28,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:09:28,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:28,888 INFO L130 PetriNetUnfolder]: 2567/3892 cut-off events. [2023-01-27 18:09:28,889 INFO L131 PetriNetUnfolder]: For 2841/2841 co-relation queries the response was YES. [2023-01-27 18:09:28,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10770 conditions, 3892 events. 2567/3892 cut-off events. For 2841/2841 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19261 event pairs, 558 based on Foata normal form. 224/4116 useless extension candidates. Maximal degree in co-relation 10756. Up to 1791 conditions per place. [2023-01-27 18:09:28,905 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 43 selfloop transitions, 7 changer transitions 35/85 dead transitions. [2023-01-27 18:09:28,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 494 flow [2023-01-27 18:09:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:09:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:09:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2023-01-27 18:09:28,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47733516483516486 [2023-01-27 18:09:28,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2023-01-27 18:09:28,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2023-01-27 18:09:28,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:28,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2023-01-27 18:09:28,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,911 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,911 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 122 flow. Second operand 7 states and 695 transitions. [2023-01-27 18:09:28,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 85 transitions, 494 flow [2023-01-27 18:09:28,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 85 transitions, 452 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:28,925 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 166 flow [2023-01-27 18:09:28,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-01-27 18:09:28,926 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-01-27 18:09:28,928 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 166 flow [2023-01-27 18:09:28,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:28,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:28,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:28,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:09:28,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:28,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 968834139, now seen corresponding path program 1 times [2023-01-27 18:09:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636716753] [2023-01-27 18:09:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:29,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636716753] [2023-01-27 18:09:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636716753] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755802560] [2023-01-27 18:09:29,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:29,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:09:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:09:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:09:29,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 208 [2023-01-27 18:09:29,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:29,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 208 [2023-01-27 18:09:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:29,506 INFO L130 PetriNetUnfolder]: 2175/3308 cut-off events. [2023-01-27 18:09:29,506 INFO L131 PetriNetUnfolder]: For 4869/4869 co-relation queries the response was YES. [2023-01-27 18:09:29,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9846 conditions, 3308 events. 2175/3308 cut-off events. For 4869/4869 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15892 event pairs, 784 based on Foata normal form. 160/3468 useless extension candidates. Maximal degree in co-relation 9826. Up to 1518 conditions per place. [2023-01-27 18:09:29,526 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 49 selfloop transitions, 11 changer transitions 28/88 dead transitions. [2023-01-27 18:09:29,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 562 flow [2023-01-27 18:09:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:09:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:09:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 697 transitions. [2023-01-27 18:09:29,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47870879120879123 [2023-01-27 18:09:29,528 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 697 transitions. [2023-01-27 18:09:29,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 697 transitions. [2023-01-27 18:09:29,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:29,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 697 transitions. [2023-01-27 18:09:29,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,539 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,539 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 166 flow. Second operand 7 states and 697 transitions. [2023-01-27 18:09:29,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 562 flow [2023-01-27 18:09:29,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 541 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-27 18:09:29,551 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 254 flow [2023-01-27 18:09:29,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-01-27 18:09:29,552 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-01-27 18:09:29,552 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 254 flow [2023-01-27 18:09:29,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:29,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:29,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:09:29,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:29,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1632307092, now seen corresponding path program 1 times [2023-01-27 18:09:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809148625] [2023-01-27 18:09:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:29,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:29,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:29,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809148625] [2023-01-27 18:09:29,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809148625] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:29,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:29,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:09:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341663000] [2023-01-27 18:09:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:29,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:09:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:09:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:09:29,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 208 [2023-01-27 18:09:29,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:29,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 208 [2023-01-27 18:09:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:29,880 INFO L130 PetriNetUnfolder]: 794/1368 cut-off events. [2023-01-27 18:09:29,880 INFO L131 PetriNetUnfolder]: For 2701/2767 co-relation queries the response was YES. [2023-01-27 18:09:29,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 1368 events. 794/1368 cut-off events. For 2701/2767 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6900 event pairs, 222 based on Foata normal form. 83/1415 useless extension candidates. Maximal degree in co-relation 4246. Up to 1035 conditions per place. [2023-01-27 18:09:29,887 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-01-27 18:09:29,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 454 flow [2023-01-27 18:09:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:09:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:09:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-01-27 18:09:29,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5176282051282052 [2023-01-27 18:09:29,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-01-27 18:09:29,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-01-27 18:09:29,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:29,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-01-27 18:09:29,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,892 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 254 flow. Second operand 3 states and 323 transitions. [2023-01-27 18:09:29,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 454 flow [2023-01-27 18:09:29,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 433 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-27 18:09:29,897 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 264 flow [2023-01-27 18:09:29,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-01-27 18:09:29,898 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-01-27 18:09:29,899 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 264 flow [2023-01-27 18:09:29,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:29,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:29,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:29,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:09:29,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:29,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1254080157, now seen corresponding path program 1 times [2023-01-27 18:09:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480687709] [2023-01-27 18:09:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:30,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480687709] [2023-01-27 18:09:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480687709] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354250529] [2023-01-27 18:09:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:30,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 208 [2023-01-27 18:09:30,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:30,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 208 [2023-01-27 18:09:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:30,209 INFO L130 PetriNetUnfolder]: 390/746 cut-off events. [2023-01-27 18:09:30,209 INFO L131 PetriNetUnfolder]: For 1058/1076 co-relation queries the response was YES. [2023-01-27 18:09:30,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 746 events. 390/746 cut-off events. For 1058/1076 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3482 event pairs, 114 based on Foata normal form. 76/809 useless extension candidates. Maximal degree in co-relation 2604. Up to 249 conditions per place. [2023-01-27 18:09:30,213 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 54 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2023-01-27 18:09:30,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 561 flow [2023-01-27 18:09:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:09:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:09:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-01-27 18:09:30,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180288461538461 [2023-01-27 18:09:30,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-01-27 18:09:30,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-01-27 18:09:30,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:30,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-01-27 18:09:30,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,217 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,217 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 264 flow. Second operand 4 states and 431 transitions. [2023-01-27 18:09:30,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 561 flow [2023-01-27 18:09:30,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 553 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:09:30,221 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 296 flow [2023-01-27 18:09:30,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-01-27 18:09:30,223 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-01-27 18:09:30,223 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 296 flow [2023-01-27 18:09:30,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:30,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:30,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:09:30,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:30,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash -605274971, now seen corresponding path program 1 times [2023-01-27 18:09:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:30,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072026138] [2023-01-27 18:09:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:30,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072026138] [2023-01-27 18:09:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072026138] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:09:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161835908] [2023-01-27 18:09:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:09:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:30,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:09:30,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:09:30,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 208 [2023-01-27 18:09:30,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:30,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 208 [2023-01-27 18:09:30,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:30,706 INFO L130 PetriNetUnfolder]: 600/1091 cut-off events. [2023-01-27 18:09:30,706 INFO L131 PetriNetUnfolder]: For 2433/2433 co-relation queries the response was YES. [2023-01-27 18:09:30,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 1091 events. 600/1091 cut-off events. For 2433/2433 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5215 event pairs, 59 based on Foata normal form. 14/1105 useless extension candidates. Maximal degree in co-relation 4222. Up to 538 conditions per place. [2023-01-27 18:09:30,716 INFO L137 encePairwiseOnDemand]: 198/208 looper letters, 73 selfloop transitions, 23 changer transitions 11/107 dead transitions. [2023-01-27 18:09:30,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 107 transitions, 853 flow [2023-01-27 18:09:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:09:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:09:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-01-27 18:09:30,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684065934065934 [2023-01-27 18:09:30,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-01-27 18:09:30,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-01-27 18:09:30,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:30,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-01-27 18:09:30,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,722 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,722 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 296 flow. Second operand 7 states and 682 transitions. [2023-01-27 18:09:30,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 107 transitions, 853 flow [2023-01-27 18:09:30,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 811 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:30,729 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 475 flow [2023-01-27 18:09:30,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=475, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-01-27 18:09:30,729 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-01-27 18:09:30,729 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 475 flow [2023-01-27 18:09:30,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:30,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:30,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:09:30,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:30,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1138856327, now seen corresponding path program 2 times [2023-01-27 18:09:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:30,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200102200] [2023-01-27 18:09:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200102200] [2023-01-27 18:09:30,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200102200] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:30,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:09:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365782446] [2023-01-27 18:09:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:09:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:09:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:09:30,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 208 [2023-01-27 18:09:30,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:30,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:30,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 208 [2023-01-27 18:09:30,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:31,203 INFO L130 PetriNetUnfolder]: 721/1325 cut-off events. [2023-01-27 18:09:31,203 INFO L131 PetriNetUnfolder]: For 4522/4522 co-relation queries the response was YES. [2023-01-27 18:09:31,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1325 events. 721/1325 cut-off events. For 4522/4522 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6764 event pairs, 104 based on Foata normal form. 12/1337 useless extension candidates. Maximal degree in co-relation 5691. Up to 504 conditions per place. [2023-01-27 18:09:31,211 INFO L137 encePairwiseOnDemand]: 198/208 looper letters, 71 selfloop transitions, 21 changer transitions 33/125 dead transitions. [2023-01-27 18:09:31,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 1087 flow [2023-01-27 18:09:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:09:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:09:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-01-27 18:09:31,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2023-01-27 18:09:31,213 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-01-27 18:09:31,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-01-27 18:09:31,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:31,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-01-27 18:09:31,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,217 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,217 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 475 flow. Second operand 7 states and 692 transitions. [2023-01-27 18:09:31,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 1087 flow [2023-01-27 18:09:31,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 125 transitions, 1063 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-27 18:09:31,225 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 437 flow [2023-01-27 18:09:31,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-01-27 18:09:31,226 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-01-27 18:09:31,226 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 437 flow [2023-01-27 18:09:31,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:31,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:31,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:09:31,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:31,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1665634873, now seen corresponding path program 3 times [2023-01-27 18:09:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303518039] [2023-01-27 18:09:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303518039] [2023-01-27 18:09:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303518039] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:31,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:09:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759096251] [2023-01-27 18:09:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:31,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:09:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:31,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:09:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:09:31,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 208 [2023-01-27 18:09:31,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:31,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 208 [2023-01-27 18:09:31,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:31,508 INFO L130 PetriNetUnfolder]: 367/717 cut-off events. [2023-01-27 18:09:31,509 INFO L131 PetriNetUnfolder]: For 2781/2792 co-relation queries the response was YES. [2023-01-27 18:09:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3028 conditions, 717 events. 367/717 cut-off events. For 2781/2792 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3553 event pairs, 111 based on Foata normal form. 34/739 useless extension candidates. Maximal degree in co-relation 3005. Up to 282 conditions per place. [2023-01-27 18:09:31,512 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 39 selfloop transitions, 10 changer transitions 22/80 dead transitions. [2023-01-27 18:09:31,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 829 flow [2023-01-27 18:09:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:09:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:09:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-01-27 18:09:31,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067307692307692 [2023-01-27 18:09:31,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-01-27 18:09:31,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-01-27 18:09:31,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:31,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-01-27 18:09:31,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,516 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,516 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 437 flow. Second operand 5 states and 527 transitions. [2023-01-27 18:09:31,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 829 flow [2023-01-27 18:09:31,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 724 flow, removed 5 selfloop flow, removed 9 redundant places. [2023-01-27 18:09:31,520 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 280 flow [2023-01-27 18:09:31,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-01-27 18:09:31,521 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-01-27 18:09:31,521 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 280 flow [2023-01-27 18:09:31,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:31,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:31,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:09:31,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:31,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -799425832, now seen corresponding path program 1 times [2023-01-27 18:09:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755992759] [2023-01-27 18:09:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755992759] [2023-01-27 18:09:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755992759] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:09:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329668638] [2023-01-27 18:09:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:09:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:09:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:09:31,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 208 [2023-01-27 18:09:31,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:31,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 208 [2023-01-27 18:09:31,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:31,778 INFO L130 PetriNetUnfolder]: 311/606 cut-off events. [2023-01-27 18:09:31,778 INFO L131 PetriNetUnfolder]: For 2082/2082 co-relation queries the response was YES. [2023-01-27 18:09:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 606 events. 311/606 cut-off events. For 2082/2082 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2727 event pairs, 138 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 2456. Up to 312 conditions per place. [2023-01-27 18:09:31,780 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 30 selfloop transitions, 2 changer transitions 26/59 dead transitions. [2023-01-27 18:09:31,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 526 flow [2023-01-27 18:09:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:09:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:09:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-01-27 18:09:31,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49759615384615385 [2023-01-27 18:09:31,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-01-27 18:09:31,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-01-27 18:09:31,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:31,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-01-27 18:09:31,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,784 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,784 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 280 flow. Second operand 4 states and 414 transitions. [2023-01-27 18:09:31,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 526 flow [2023-01-27 18:09:31,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 438 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-01-27 18:09:31,788 INFO L231 Difference]: Finished difference. Result has 54 places, 29 transitions, 145 flow [2023-01-27 18:09:31,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=29} [2023-01-27 18:09:31,789 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-01-27 18:09:31,789 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 29 transitions, 145 flow [2023-01-27 18:09:31,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:31,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:31,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:09:31,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:31,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1257115910, now seen corresponding path program 2 times [2023-01-27 18:09:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:31,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236679837] [2023-01-27 18:09:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:09:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:09:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:09:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236679837] [2023-01-27 18:09:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236679837] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:09:32,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:09:32,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:09:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309002345] [2023-01-27 18:09:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:09:32,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:09:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:09:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:09:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:09:32,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 208 [2023-01-27 18:09:32,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 29 transitions, 145 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:32,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:09:32,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 208 [2023-01-27 18:09:32,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:09:32,737 INFO L130 PetriNetUnfolder]: 106/226 cut-off events. [2023-01-27 18:09:32,737 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-01-27 18:09:32,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 226 events. 106/226 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 736 event pairs, 27 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 759. Up to 119 conditions per place. [2023-01-27 18:09:32,738 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 31 selfloop transitions, 5 changer transitions 23/59 dead transitions. [2023-01-27 18:09:32,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 411 flow [2023-01-27 18:09:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:09:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:09:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 766 transitions. [2023-01-27 18:09:32,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4091880341880342 [2023-01-27 18:09:32,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 766 transitions. [2023-01-27 18:09:32,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 766 transitions. [2023-01-27 18:09:32,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:09:32,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 766 transitions. [2023-01-27 18:09:32,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.11111111111111) internal successors, (766), 9 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:32,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:32,744 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:32,744 INFO L175 Difference]: Start difference. First operand has 54 places, 29 transitions, 145 flow. Second operand 9 states and 766 transitions. [2023-01-27 18:09:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 411 flow [2023-01-27 18:09:32,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 373 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-01-27 18:09:32,746 INFO L231 Difference]: Finished difference. Result has 53 places, 29 transitions, 143 flow [2023-01-27 18:09:32,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=29} [2023-01-27 18:09:32,746 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-01-27 18:09:32,746 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 29 transitions, 143 flow [2023-01-27 18:09:32,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:09:32,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:09:32,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:32,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:09:32,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:09:32,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:09:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1542077972, now seen corresponding path program 3 times [2023-01-27 18:09:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:09:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285401895] [2023-01-27 18:09:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:09:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:09:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:09:32,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:09:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:09:32,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:09:32,824 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:09:32,825 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:09:32,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:09:32,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:09:32,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:09:32,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:09:32,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:09:32,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:09:32,827 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-01-27 18:09:32,832 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:09:32,832 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:09:32,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:09:32 BasicIcfg [2023-01-27 18:09:32,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:09:32,891 INFO L158 Benchmark]: Toolchain (without parser) took 9731.03ms. Allocated memory was 404.8MB in the beginning and 597.7MB in the end (delta: 192.9MB). Free memory was 371.8MB in the beginning and 334.5MB in the end (delta: 37.3MB). Peak memory consumption was 231.6MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,891 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:09:32,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.52ms. Allocated memory is still 404.8MB. Free memory was 371.8MB in the beginning and 348.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.07ms. Allocated memory is still 404.8MB. Free memory was 348.7MB in the beginning and 346.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,892 INFO L158 Benchmark]: Boogie Preprocessor took 21.40ms. Allocated memory is still 404.8MB. Free memory was 346.2MB in the beginning and 344.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,892 INFO L158 Benchmark]: RCFGBuilder took 578.29ms. Allocated memory is still 404.8MB. Free memory was 344.1MB in the beginning and 311.0MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,892 INFO L158 Benchmark]: TraceAbstraction took 8706.94ms. Allocated memory was 404.8MB in the beginning and 597.7MB in the end (delta: 192.9MB). Free memory was 310.6MB in the beginning and 334.5MB in the end (delta: -23.9MB). Peak memory consumption was 170.8MB. Max. memory is 16.0GB. [2023-01-27 18:09:32,893 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 377.52ms. Allocated memory is still 404.8MB. Free memory was 371.8MB in the beginning and 348.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.07ms. Allocated memory is still 404.8MB. Free memory was 348.7MB in the beginning and 346.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.40ms. Allocated memory is still 404.8MB. Free memory was 346.2MB in the beginning and 344.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 578.29ms. Allocated memory is still 404.8MB. Free memory was 344.1MB in the beginning and 311.0MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 8706.94ms. Allocated memory was 404.8MB in the beginning and 597.7MB in the end (delta: 192.9MB). Free memory was 310.6MB in the beginning and 334.5MB in the end (delta: -23.9MB). Peak memory consumption was 170.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 118 PlacesBefore, 36 PlacesAfterwards, 110 TransitionsBefore, 27 TransitionsAfterwards, 2112 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6052 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2524, independent: 2321, independent conditional: 0, independent unconditional: 2321, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1123, independent: 1090, independent conditional: 0, independent unconditional: 1090, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2524, independent: 1231, independent conditional: 0, independent unconditional: 1231, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1123, unknown conditional: 0, unknown unconditional: 1123] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=-2, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=-1, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 845]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1129 IncrementalHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 43 mSDtfsCounter, 1129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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! [2023-01-27 18:09:32,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...