/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/mix001.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:02:28,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:02:28,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:02:28,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:02:28,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:02:28,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:02:28,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:02:28,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:02:28,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:02:28,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:02:28,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:02:28,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:02:28,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:02:28,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:02:28,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:02:28,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:02:28,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:02:28,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:02:28,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:02:28,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:02:28,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:02:28,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:02:28,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:02:28,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:02:28,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:02:28,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:02:28,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:02:28,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:02:28,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:02:28,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:02:28,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:02:28,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:02:28,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:02:28,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:02:28,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:02:28,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:02:28,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:02:28,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:02:28,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:02:28,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:02:28,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:02:28,553 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:02:28,580 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:02:28,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:02:28,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:02:28,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:02:28,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:02:28,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:02:28,583 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:02:28,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:02:28,583 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:02:28,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:02:28,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:02:28,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:02:28,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:02:28,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:02:28,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:28,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:02:28,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:02:28,587 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:02:28,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:02:28,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:02:28,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:02:28,802 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:02:28,804 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:02:28,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2023-01-27 18:02:29,960 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:02:30,220 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:02:30,221 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2023-01-27 18:02:30,236 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2253c77/7d5fa8e2d883419cb0d0f89df673406e/FLAGefe4e70bc [2023-01-27 18:02:30,248 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2253c77/7d5fa8e2d883419cb0d0f89df673406e [2023-01-27 18:02:30,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:02:30,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:02:30,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:30,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:02:30,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:02:30,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2f3f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30, skipping insertion in model container [2023-01-27 18:02:30,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:02:30,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:02:30,447 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/mix001.opt.i[944,957] [2023-01-27 18:02:30,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:30,688 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:02:30,709 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/mix001.opt.i[944,957] [2023-01-27 18:02:30,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:02:30,800 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:30,801 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:02:30,807 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:02:30,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30 WrapperNode [2023-01-27 18:02:30,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:02:30,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:30,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:02:30,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:02:30,815 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:02:30" (1/1) ... [2023-01-27 18:02:30,831 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:02:30" (1/1) ... [2023-01-27 18:02:30,855 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-01-27 18:02:30,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:02:30,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:02:30,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:02:30,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:02:30,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:02:30,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:02:30,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:02:30,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:02:30,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (1/1) ... [2023-01-27 18:02:30,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:02:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:02:30,930 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:02:30,932 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:02:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:02:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:02:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:02:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:02:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:02:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:02:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:02:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:02:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:02:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:02:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:02:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:02:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:02:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:02:30,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:02:30,969 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:02:31,180 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:02:31,182 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:02:31,545 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:02:31,690 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:02:31,691 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:02:31,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:31 BoogieIcfgContainer [2023-01-27 18:02:31,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:02:31,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:02:31,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:02:31,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:02:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:02:30" (1/3) ... [2023-01-27 18:02:31,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a633e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:31, skipping insertion in model container [2023-01-27 18:02:31,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:02:30" (2/3) ... [2023-01-27 18:02:31,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a633e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:02:31, skipping insertion in model container [2023-01-27 18:02:31,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:02:31" (3/3) ... [2023-01-27 18:02:31,700 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2023-01-27 18:02:31,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:02:31,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:02:31,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:02:31,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:02:31,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2023-01-27 18:02:31,852 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-01-27 18:02:31,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:31,858 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 3. Compared 56 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:02:31,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2023-01-27 18:02:31,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-01-27 18:02:31,864 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:02:31,872 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-01-27 18:02:31,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-01-27 18:02:31,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-01-27 18:02:31,898 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-01-27 18:02:31,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:31,899 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 3. Compared 56 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:02:31,901 INFO L119 LiptonReduction]: Number of co-enabled transitions 1978 [2023-01-27 18:02:35,304 INFO L134 LiptonReduction]: Checked pairs total: 5707 [2023-01-27 18:02:35,304 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-01-27 18:02:35,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:02:35,323 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;@75ecb608, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:02:35,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:02:35,328 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-01-27 18:02:35,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:02:35,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:35,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:35,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:35,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1921051130, now seen corresponding path program 1 times [2023-01-27 18:02:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:35,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145468649] [2023-01-27 18:02:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:35,762 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:02:35,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:35,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145468649] [2023-01-27 18:02:35,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145468649] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:35,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271877730] [2023-01-27 18:02:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:35,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 212 [2023-01-27 18:02:35,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:02:35,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:35,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 212 [2023-01-27 18:02:35,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:36,027 INFO L130 PetriNetUnfolder]: 644/1045 cut-off events. [2023-01-27 18:02:36,027 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-27 18:02:36,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1045 events. 644/1045 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5341 event pairs, 112 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 2046. Up to 773 conditions per place. [2023-01-27 18:02:36,039 INFO L137 encePairwiseOnDemand]: 208/212 looper letters, 24 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-01-27 18:02:36,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 129 flow [2023-01-27 18:02:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-01-27 18:02:36,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204402515723271 [2023-01-27 18:02:36,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-01-27 18:02:36,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-01-27 18:02:36,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:36,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-01-27 18:02:36,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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:02:36,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:36,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:36,076 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 331 transitions. [2023-01-27 18:02:36,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 129 flow [2023-01-27 18:02:36,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:02:36,083 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-27 18:02:36,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:02:36,101 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:02:36,101 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-27 18:02:36,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:02:36,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:36,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:36,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:02:36,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:36,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash -705746074, now seen corresponding path program 1 times [2023-01-27 18:02:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175191928] [2023-01-27 18:02:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:36,415 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:02:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175191928] [2023-01-27 18:02:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175191928] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980273701] [2023-01-27 18:02:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:36,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:36,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:36,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-27 18:02:36,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:02:36,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:36,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-27 18:02:36,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:36,703 INFO L130 PetriNetUnfolder]: 1375/2028 cut-off events. [2023-01-27 18:02:36,703 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-01-27 18:02:36,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 2028 events. 1375/2028 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8287 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4208. Up to 1953 conditions per place. [2023-01-27 18:02:36,714 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-01-27 18:02:36,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2023-01-27 18:02:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-01-27 18:02:36,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47955974842767296 [2023-01-27 18:02:36,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-01-27 18:02:36,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-01-27 18:02:36,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:36,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-01-27 18:02:36,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:02:36,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:36,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:36,722 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 305 transitions. [2023-01-27 18:02:36,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2023-01-27 18:02:36,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:36,725 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2023-01-27 18:02:36,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-01-27 18:02:36,725 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:02:36,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2023-01-27 18:02:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:02:36,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:36,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:36,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:02:36,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:36,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1539838425, now seen corresponding path program 1 times [2023-01-27 18:02:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281941118] [2023-01-27 18:02:36,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:36,966 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:02:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281941118] [2023-01-27 18:02:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281941118] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358941284] [2023-01-27 18:02:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:36,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:36,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-27 18:02:36,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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:02:36,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:36,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-27 18:02:36,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:37,234 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2023-01-27 18:02:37,235 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-01-27 18:02:37,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7449 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2023-01-27 18:02:37,246 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-27 18:02:37,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2023-01-27 18:02:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-01-27 18:02:37,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47641509433962265 [2023-01-27 18:02:37,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-01-27 18:02:37,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-01-27 18:02:37,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:37,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-01-27 18:02:37,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:02:37,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:37,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:37,251 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 303 transitions. [2023-01-27 18:02:37,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2023-01-27 18:02:37,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:02:37,252 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2023-01-27 18:02:37,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-01-27 18:02:37,253 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-01-27 18:02:37,253 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2023-01-27 18:02:37,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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:02:37,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:37,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:37,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:02:37,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:37,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 344584266, now seen corresponding path program 1 times [2023-01-27 18:02:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:37,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834957406] [2023-01-27 18:02:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:37,498 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:02:37,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:37,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834957406] [2023-01-27 18:02:37,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834957406] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:37,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:37,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:02:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573827872] [2023-01-27 18:02:37,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:37,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:02:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:02:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:02:37,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 212 [2023-01-27 18:02:37,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 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:02:37,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:37,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 212 [2023-01-27 18:02:37,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:37,657 INFO L130 PetriNetUnfolder]: 670/1079 cut-off events. [2023-01-27 18:02:37,658 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2023-01-27 18:02:37,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 1079 events. 670/1079 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5042 event pairs, 259 based on Foata normal form. 24/1096 useless extension candidates. Maximal degree in co-relation 2476. Up to 697 conditions per place. [2023-01-27 18:02:37,664 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-01-27 18:02:37,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 172 flow [2023-01-27 18:02:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-01-27 18:02:37,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094339622641509 [2023-01-27 18:02:37,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-01-27 18:02:37,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-01-27 18:02:37,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:37,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-01-27 18:02:37,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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:02:37,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:37,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:37,673 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 324 transitions. [2023-01-27 18:02:37,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 172 flow [2023-01-27 18:02:37,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:37,676 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-01-27 18:02:37,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-01-27 18:02:37,678 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-27 18:02:37,678 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-01-27 18:02:37,679 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:02:37,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:37,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:37,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:02:37,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:37,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1051297848, now seen corresponding path program 1 times [2023-01-27 18:02:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393494005] [2023-01-27 18:02:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:37,912 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:02:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393494005] [2023-01-27 18:02:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393494005] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:02:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728892186] [2023-01-27 18:02:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:37,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-27 18:02:37,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:02:37,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:37,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-27 18:02:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:38,144 INFO L130 PetriNetUnfolder]: 1109/1656 cut-off events. [2023-01-27 18:02:38,144 INFO L131 PetriNetUnfolder]: For 688/688 co-relation queries the response was YES. [2023-01-27 18:02:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 1656 events. 1109/1656 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6526 event pairs, 680 based on Foata normal form. 24/1680 useless extension candidates. Maximal degree in co-relation 4028. Up to 1099 conditions per place. [2023-01-27 18:02:38,153 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-27 18:02:38,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 210 flow [2023-01-27 18:02:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:02:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:02:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-01-27 18:02:38,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2023-01-27 18:02:38,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-01-27 18:02:38,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-01-27 18:02:38,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:38,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-01-27 18:02:38,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:02:38,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:38,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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:02:38,158 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 3 states and 308 transitions. [2023-01-27 18:02:38,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 210 flow [2023-01-27 18:02:38,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:38,160 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 93 flow [2023-01-27 18:02:38,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-01-27 18:02:38,163 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-27 18:02:38,163 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 93 flow [2023-01-27 18:02:38,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:02:38,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:38,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:38,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:02:38,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:38,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1924428869, now seen corresponding path program 1 times [2023-01-27 18:02:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344584008] [2023-01-27 18:02:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:38,466 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:02:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:38,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344584008] [2023-01-27 18:02:38,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344584008] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:38,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:38,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701129725] [2023-01-27 18:02:38,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:38,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:38,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-01-27 18:02:38,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:02:38,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:38,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-01-27 18:02:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:38,678 INFO L130 PetriNetUnfolder]: 448/792 cut-off events. [2023-01-27 18:02:38,678 INFO L131 PetriNetUnfolder]: For 182/186 co-relation queries the response was YES. [2023-01-27 18:02:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 792 events. 448/792 cut-off events. For 182/186 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3932 event pairs, 88 based on Foata normal form. 88/863 useless extension candidates. Maximal degree in co-relation 1804. Up to 437 conditions per place. [2023-01-27 18:02:38,682 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 43 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2023-01-27 18:02:38,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 279 flow [2023-01-27 18:02:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:02:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:02:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-01-27 18:02:38,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49245283018867925 [2023-01-27 18:02:38,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-01-27 18:02:38,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-01-27 18:02:38,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:38,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-01-27 18:02:38,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:02:38,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:02:38,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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:02:38,690 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 93 flow. Second operand 5 states and 522 transitions. [2023-01-27 18:02:38,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 279 flow [2023-01-27 18:02:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:38,695 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2023-01-27 18:02:38,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-01-27 18:02:38,697 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-27 18:02:38,698 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 141 flow [2023-01-27 18:02:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:02:38,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:38,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:02:38,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:38,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2021045542, now seen corresponding path program 1 times [2023-01-27 18:02:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474633185] [2023-01-27 18:02:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:38,929 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:02:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474633185] [2023-01-27 18:02:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474633185] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:02:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355872032] [2023-01-27 18:02:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:02:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:02:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:02:38,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-01-27 18:02:38,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:02:38,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:38,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-01-27 18:02:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:39,208 INFO L130 PetriNetUnfolder]: 1071/1751 cut-off events. [2023-01-27 18:02:39,209 INFO L131 PetriNetUnfolder]: For 1452/1452 co-relation queries the response was YES. [2023-01-27 18:02:39,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1751 events. 1071/1751 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8549 event pairs, 103 based on Foata normal form. 18/1769 useless extension candidates. Maximal degree in co-relation 5505. Up to 1059 conditions per place. [2023-01-27 18:02:39,217 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 53 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2023-01-27 18:02:39,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 510 flow [2023-01-27 18:02:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:02:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:02:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2023-01-27 18:02:39,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46776729559748426 [2023-01-27 18:02:39,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions. [2023-01-27 18:02:39,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions. [2023-01-27 18:02:39,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:39,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions. [2023-01-27 18:02:39,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:02:39,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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:02:39,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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:02:39,223 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 141 flow. Second operand 6 states and 595 transitions. [2023-01-27 18:02:39,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 510 flow [2023-01-27 18:02:39,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:02:39,228 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 161 flow [2023-01-27 18:02:39,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-01-27 18:02:39,229 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-27 18:02:39,229 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 161 flow [2023-01-27 18:02:39,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:02:39,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:39,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:39,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:02:39,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:39,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1521427716, now seen corresponding path program 2 times [2023-01-27 18:02:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343610375] [2023-01-27 18:02:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:39,510 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:02:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:39,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343610375] [2023-01-27 18:02:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343610375] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:02:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720454454] [2023-01-27 18:02:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:02:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:02:39,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:02:39,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-01-27 18:02:39,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:02:39,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:39,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-01-27 18:02:39,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:39,688 INFO L130 PetriNetUnfolder]: 339/661 cut-off events. [2023-01-27 18:02:39,689 INFO L131 PetriNetUnfolder]: For 504/507 co-relation queries the response was YES. [2023-01-27 18:02:39,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 661 events. 339/661 cut-off events. For 504/507 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3334 event pairs, 64 based on Foata normal form. 74/715 useless extension candidates. Maximal degree in co-relation 1966. Up to 252 conditions per place. [2023-01-27 18:02:39,692 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 45 selfloop transitions, 10 changer transitions 9/72 dead transitions. [2023-01-27 18:02:39,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 437 flow [2023-01-27 18:02:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:02:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:02:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2023-01-27 18:02:39,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49292452830188677 [2023-01-27 18:02:39,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2023-01-27 18:02:39,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2023-01-27 18:02:39,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:39,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2023-01-27 18:02:39,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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:02:39,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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:02:39,699 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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:02:39,699 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 161 flow. Second operand 6 states and 627 transitions. [2023-01-27 18:02:39,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 437 flow [2023-01-27 18:02:39,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 429 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:02:39,705 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 233 flow [2023-01-27 18:02:39,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-01-27 18:02:39,707 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-27 18:02:39,707 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 233 flow [2023-01-27 18:02:39,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:02:39,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:39,707 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:02:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:02:39,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:39,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -911674382, now seen corresponding path program 1 times [2023-01-27 18:02:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543630957] [2023-01-27 18:02:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:39,991 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:02:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543630957] [2023-01-27 18:02:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543630957] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:39,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:02:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444914078] [2023-01-27 18:02:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:39,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:02:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:39,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:02:39,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:02:39,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-01-27 18:02:39,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:02:39,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:39,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-01-27 18:02:39,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:40,188 INFO L130 PetriNetUnfolder]: 296/593 cut-off events. [2023-01-27 18:02:40,188 INFO L131 PetriNetUnfolder]: For 788/790 co-relation queries the response was YES. [2023-01-27 18:02:40,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 593 events. 296/593 cut-off events. For 788/790 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3032 event pairs, 59 based on Foata normal form. 21/594 useless extension candidates. Maximal degree in co-relation 2049. Up to 225 conditions per place. [2023-01-27 18:02:40,191 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 34 selfloop transitions, 11 changer transitions 22/72 dead transitions. [2023-01-27 18:02:40,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 483 flow [2023-01-27 18:02:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:02:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:02:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2023-01-27 18:02:40,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805424528301887 [2023-01-27 18:02:40,195 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2023-01-27 18:02:40,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2023-01-27 18:02:40,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:40,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2023-01-27 18:02:40,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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:02:40,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:02:40,200 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:02:40,200 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 233 flow. Second operand 8 states and 815 transitions. [2023-01-27 18:02:40,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 483 flow [2023-01-27 18:02:40,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-27 18:02:40,209 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 182 flow [2023-01-27 18:02:40,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2023-01-27 18:02:40,210 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-01-27 18:02:40,210 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 182 flow [2023-01-27 18:02:40,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:02:40,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:40,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:40,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:02:40,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:40,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 887403869, now seen corresponding path program 1 times [2023-01-27 18:02:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856387923] [2023-01-27 18:02:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:40,536 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:02:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856387923] [2023-01-27 18:02:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856387923] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:02:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624436333] [2023-01-27 18:02:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:40,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:02:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:40,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:02:40,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:02:40,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-01-27 18:02:40,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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:02:40,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:40,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-01-27 18:02:40,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:40,680 INFO L130 PetriNetUnfolder]: 297/598 cut-off events. [2023-01-27 18:02:40,681 INFO L131 PetriNetUnfolder]: For 1065/1065 co-relation queries the response was YES. [2023-01-27 18:02:40,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 598 events. 297/598 cut-off events. For 1065/1065 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2967 event pairs, 82 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 2005. Up to 343 conditions per place. [2023-01-27 18:02:40,683 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 27 selfloop transitions, 1 changer transitions 32/62 dead transitions. [2023-01-27 18:02:40,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 496 flow [2023-01-27 18:02:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:02:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:02:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-01-27 18:02:40,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988207547169811 [2023-01-27 18:02:40,685 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-01-27 18:02:40,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-01-27 18:02:40,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:40,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-01-27 18:02:40,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:02:40,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:02:40,689 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:02:40,689 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 182 flow. Second operand 4 states and 423 transitions. [2023-01-27 18:02:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 496 flow [2023-01-27 18:02:40,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 394 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-01-27 18:02:40,695 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 124 flow [2023-01-27 18:02:40,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-01-27 18:02:40,696 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:02:40,696 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 124 flow [2023-01-27 18:02:40,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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:02:40,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:40,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:40,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:02:40,698 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:40,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1841247183, now seen corresponding path program 2 times [2023-01-27 18:02:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:40,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668945078] [2023-01-27 18:02:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:02:42,221 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:02:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:02:42,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668945078] [2023-01-27 18:02:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668945078] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:02:42,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:02:42,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:02:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917751233] [2023-01-27 18:02:42,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:02:42,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:02:42,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:02:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:02:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:02:42,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-01-27 18:02:42,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 124 flow. Second operand has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:02:42,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:02:42,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-01-27 18:02:42,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:02:42,359 INFO L130 PetriNetUnfolder]: 68/170 cut-off events. [2023-01-27 18:02:42,359 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2023-01-27 18:02:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 170 events. 68/170 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 605 event pairs, 13 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 529. Up to 63 conditions per place. [2023-01-27 18:02:42,360 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 23 selfloop transitions, 5 changer transitions 17/49 dead transitions. [2023-01-27 18:02:42,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 325 flow [2023-01-27 18:02:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:02:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:02:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2023-01-27 18:02:42,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2023-01-27 18:02:42,363 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2023-01-27 18:02:42,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2023-01-27 18:02:42,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:02:42,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2023-01-27 18:02:42,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:02:42,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:02:42,368 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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:02:42,368 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 124 flow. Second operand 8 states and 752 transitions. [2023-01-27 18:02:42,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 325 flow [2023-01-27 18:02:42,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 312 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-27 18:02:42,371 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 133 flow [2023-01-27 18:02:42,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-01-27 18:02:42,371 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-27 18:02:42,371 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 133 flow [2023-01-27 18:02:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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:02:42,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:02:42,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:42,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:02:42,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:02:42,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:02:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash -781406467, now seen corresponding path program 3 times [2023-01-27 18:02:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:02:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908221164] [2023-01-27 18:02:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:02:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:02:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:02:42,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:02:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:02:42,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:02:42,533 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:02:42,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:02:42,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:02:42,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:02:42,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:02:42,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:02:42,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:02:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:02:42,536 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:02:42,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:02:42,541 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:02:42,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:02:42 BasicIcfg [2023-01-27 18:02:42,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:02:42,611 INFO L158 Benchmark]: Toolchain (without parser) took 12360.19ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 288.1MB in the beginning and 517.5MB in the end (delta: -229.4MB). Peak memory consumption was 15.9MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,611 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 214.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:02:42,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.66ms. Allocated memory is still 331.4MB. Free memory was 288.1MB in the beginning and 264.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 331.4MB. Free memory was 264.2MB in the beginning and 261.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,612 INFO L158 Benchmark]: Boogie Preprocessor took 42.23ms. Allocated memory is still 331.4MB. Free memory was 261.5MB in the beginning and 259.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,612 INFO L158 Benchmark]: RCFGBuilder took 794.01ms. Allocated memory is still 331.4MB. Free memory was 259.4MB in the beginning and 293.3MB in the end (delta: -33.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,613 INFO L158 Benchmark]: TraceAbstraction took 10915.86ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 292.9MB in the beginning and 517.5MB in the end (delta: -224.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.0GB. [2023-01-27 18:02:42,614 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.13ms. Allocated memory is still 255.9MB. Free memory is still 214.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 555.66ms. Allocated memory is still 331.4MB. Free memory was 288.1MB in the beginning and 264.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 331.4MB. Free memory was 264.2MB in the beginning and 261.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.23ms. Allocated memory is still 331.4MB. Free memory was 261.5MB in the beginning and 259.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 794.01ms. Allocated memory is still 331.4MB. Free memory was 259.4MB in the beginning and 293.3MB in the end (delta: -33.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.0GB. * TraceAbstraction took 10915.86ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 292.9MB in the beginning and 517.5MB in the end (delta: -224.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 118 PlacesBefore, 34 PlacesAfterwards, 110 TransitionsBefore, 25 TransitionsAfterwards, 1978 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 5707 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2700, independent: 2499, independent conditional: 0, independent unconditional: 2499, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1102, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2700, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1102, unknown conditional: 0, unknown unconditional: 1102] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=-2, t17={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] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=-1, t17={5:0}, t18={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] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=0, t17={5:0}, t18={6:0}, t19={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] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$r_buff0_thd3=1, 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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=1, 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] [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x=1, 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=1, 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=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, 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=1, 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=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x=1, 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=1, 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=1] - UnprovableResult [Line: 18]: 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: 854]: 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: 856]: 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: 858]: 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, 141 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: 10.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 769 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 20 mSDtfsCounter, 769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=8, InterpolantAutomatonStates: 52, 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.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 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:02:42,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...