/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/mix053.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:14:10,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:14:10,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:14:10,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:14:10,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:14:10,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:14:10,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:14:10,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:14:10,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:14:10,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:14:10,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:14:10,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:14:10,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:14:10,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:14:10,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:14:10,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:14:10,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:14:10,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:14:10,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:14:10,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:14:10,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:14:10,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:14:10,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:14:10,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:14:10,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:14:10,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:14:10,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:14:10,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:14:10,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:14:10,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:14:10,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:14:10,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:14:10,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:14:10,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:14:10,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:14:10,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:14:10,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:14:10,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:14:10,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:14:10,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:14:10,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:14:10,918 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:14:10,942 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:14:10,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:14:10,943 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:14:10,943 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:14:10,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:14:10,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:14:10,943 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:14:10,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:14:10,944 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:14:10,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:14:10,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:10,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:14:10,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:14:10,946 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:14:11,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:14:11,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:14:11,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:14:11,212 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:14:11,213 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:14:11,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-01-27 18:14:12,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:14:12,729 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:14:12,729 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-01-27 18:14:12,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ed365d5/805afd0bd8954757a5c3b0138937a466/FLAG0038c529c [2023-01-27 18:14:12,756 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ed365d5/805afd0bd8954757a5c3b0138937a466 [2023-01-27 18:14:12,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:14:12,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:14:12,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:12,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:14:12,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:14:12,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:12" (1/1) ... [2023-01-27 18:14:12,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b90fb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:12, skipping insertion in model container [2023-01-27 18:14:12,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:12" (1/1) ... [2023-01-27 18:14:12,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:14:12,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:14:13,001 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/mix053.opt.i[944,957] [2023-01-27 18:14:13,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:13,230 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:14:13,245 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/mix053.opt.i[944,957] [2023-01-27 18:14:13,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:13,336 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:13,337 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:13,343 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:14:13,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13 WrapperNode [2023-01-27 18:14:13,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:13,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:13,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:14:13,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:14:13,350 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:14:13" (1/1) ... [2023-01-27 18:14:13,377 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:14:13" (1/1) ... [2023-01-27 18:14:13,404 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-27 18:14:13,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:13,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:14:13,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:14:13,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:14:13,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:14:13,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:14:13,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:14:13,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:14:13,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:13,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:14:13,486 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:14:13,488 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:14:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:14:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:14:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:14:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:14:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:14:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:14:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:14:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:14:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:14:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:14:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:14:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:14:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:14:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:14:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:14:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:14:13,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:14:13,524 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:14:13,650 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:14:13,651 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:14:13,987 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:14:14,067 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:14:14,067 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:14:14,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:14 BoogieIcfgContainer [2023-01-27 18:14:14,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:14:14,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:14:14,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:14:14,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:14:14,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:14:12" (1/3) ... [2023-01-27 18:14:14,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff72ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:14, skipping insertion in model container [2023-01-27 18:14:14,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13" (2/3) ... [2023-01-27 18:14:14,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff72ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:14, skipping insertion in model container [2023-01-27 18:14:14,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:14" (3/3) ... [2023-01-27 18:14:14,076 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-01-27 18:14:14,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:14:14,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:14:14,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:14:14,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:14:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2023-01-27 18:14:14,241 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-01-27 18:14:14,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:14,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-01-27 18:14:14,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2023-01-27 18:14:14,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2023-01-27 18:14:14,256 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:14:14,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2023-01-27 18:14:14,267 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2023-01-27 18:14:14,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2023-01-27 18:14:14,289 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-01-27 18:14:14,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:14,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-01-27 18:14:14,292 INFO L119 LiptonReduction]: Number of co-enabled transitions 2620 [2023-01-27 18:14:17,896 INFO L134 LiptonReduction]: Checked pairs total: 6159 [2023-01-27 18:14:17,897 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-27 18:14:17,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:14:17,915 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;@485c8175, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:14:17,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:14:17,919 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2023-01-27 18:14:17,919 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:17,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:17,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:17,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:17,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1951838619, now seen corresponding path program 1 times [2023-01-27 18:14:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101096661] [2023-01-27 18:14:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:18,362 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:14:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101096661] [2023-01-27 18:14:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101096661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130478691] [2023-01-27 18:14:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:18,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:18,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 232 [2023-01-27 18:14:18,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:14:18,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:18,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 232 [2023-01-27 18:14:18,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:18,843 INFO L130 PetriNetUnfolder]: 2075/3080 cut-off events. [2023-01-27 18:14:18,843 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-01-27 18:14:18,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6076 conditions, 3080 events. 2075/3080 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15902 event pairs, 518 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6064. Up to 2098 conditions per place. [2023-01-27 18:14:18,864 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-01-27 18:14:18,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 150 flow [2023-01-27 18:14:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-01-27 18:14:18,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2023-01-27 18:14:18,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-01-27 18:14:18,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-01-27 18:14:18,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:18,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-01-27 18:14:18,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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:14:18,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:18,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:18,894 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 372 transitions. [2023-01-27 18:14:18,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 150 flow [2023-01-27 18:14:18,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:18,900 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 60 flow [2023-01-27 18:14:18,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-01-27 18:14:18,905 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-01-27 18:14:18,905 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 60 flow [2023-01-27 18:14:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:14:18,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:18,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:14:18,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:18,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1183873960, now seen corresponding path program 1 times [2023-01-27 18:14:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365689617] [2023-01-27 18:14:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:19,298 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:14:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:19,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365689617] [2023-01-27 18:14:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365689617] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978547343] [2023-01-27 18:14:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:19,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:19,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:19,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:19,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:14:19,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:19,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:20,178 INFO L130 PetriNetUnfolder]: 6105/8506 cut-off events. [2023-01-27 18:14:20,178 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2023-01-27 18:14:20,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17670 conditions, 8506 events. 6105/8506 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42360 event pairs, 2153 based on Foata normal form. 244/8750 useless extension candidates. Maximal degree in co-relation 17660. Up to 5069 conditions per place. [2023-01-27 18:14:20,225 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 36 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2023-01-27 18:14:20,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 190 flow [2023-01-27 18:14:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-01-27 18:14:20,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507183908045977 [2023-01-27 18:14:20,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-01-27 18:14:20,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-01-27 18:14:20,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:20,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-01-27 18:14:20,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:14:20,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:20,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:20,231 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 3 states and 353 transitions. [2023-01-27 18:14:20,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 190 flow [2023-01-27 18:14:20,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:20,240 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 110 flow [2023-01-27 18:14:20,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-27 18:14:20,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-01-27 18:14:20,241 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 110 flow [2023-01-27 18:14:20,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:14:20,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:20,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:20,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:14:20,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:20,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1954613890, now seen corresponding path program 1 times [2023-01-27 18:14:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620025770] [2023-01-27 18:14:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:20,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:14:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620025770] [2023-01-27 18:14:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620025770] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998194259] [2023-01-27 18:14:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:20,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:20,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-01-27 18:14:20,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:14:20,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:20,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-01-27 18:14:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:21,123 INFO L130 PetriNetUnfolder]: 5032/7204 cut-off events. [2023-01-27 18:14:21,124 INFO L131 PetriNetUnfolder]: For 3193/3203 co-relation queries the response was YES. [2023-01-27 18:14:21,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18342 conditions, 7204 events. 5032/7204 cut-off events. For 3193/3203 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39299 event pairs, 1101 based on Foata normal form. 36/7007 useless extension candidates. Maximal degree in co-relation 18330. Up to 6307 conditions per place. [2023-01-27 18:14:21,177 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-01-27 18:14:21,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 252 flow [2023-01-27 18:14:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-01-27 18:14:21,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2023-01-27 18:14:21,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-01-27 18:14:21,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-01-27 18:14:21,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:21,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-01-27 18:14:21,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:14:21,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:21,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:21,183 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 110 flow. Second operand 3 states and 364 transitions. [2023-01-27 18:14:21,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 252 flow [2023-01-27 18:14:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:21,200 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 137 flow [2023-01-27 18:14:21,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2023-01-27 18:14:21,202 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-01-27 18:14:21,204 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 137 flow [2023-01-27 18:14:21,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:14:21,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:21,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:21,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:14:21,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:21,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1954614324, now seen corresponding path program 1 times [2023-01-27 18:14:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131160945] [2023-01-27 18:14:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:21,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:21,411 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:14:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131160945] [2023-01-27 18:14:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131160945] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127005479] [2023-01-27 18:14:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:21,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:21,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-01-27 18:14:21,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:14:21,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:21,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-01-27 18:14:21,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:22,038 INFO L130 PetriNetUnfolder]: 4786/6937 cut-off events. [2023-01-27 18:14:22,038 INFO L131 PetriNetUnfolder]: For 2932/3026 co-relation queries the response was YES. [2023-01-27 18:14:22,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17498 conditions, 6937 events. 4786/6937 cut-off events. For 2932/3026 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 37624 event pairs, 1776 based on Foata normal form. 90/6879 useless extension candidates. Maximal degree in co-relation 17485. Up to 6140 conditions per place. [2023-01-27 18:14:22,088 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-01-27 18:14:22,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 299 flow [2023-01-27 18:14:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-01-27 18:14:22,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272988505747126 [2023-01-27 18:14:22,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-01-27 18:14:22,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-01-27 18:14:22,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:22,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-01-27 18:14:22,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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:14:22,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:22,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:22,098 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 137 flow. Second operand 3 states and 367 transitions. [2023-01-27 18:14:22,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 299 flow [2023-01-27 18:14:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:22,100 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 173 flow [2023-01-27 18:14:22,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-01-27 18:14:22,102 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-01-27 18:14:22,102 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 173 flow [2023-01-27 18:14:22,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:14:22,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:22,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:14:22,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:22,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash -463489866, now seen corresponding path program 1 times [2023-01-27 18:14:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045690864] [2023-01-27 18:14:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:22,330 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:14:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045690864] [2023-01-27 18:14:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045690864] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:22,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036885019] [2023-01-27 18:14:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:22,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:22,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:22,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:14:22,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:22,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:22,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:23,022 INFO L130 PetriNetUnfolder]: 3944/5909 cut-off events. [2023-01-27 18:14:23,023 INFO L131 PetriNetUnfolder]: For 4120/4476 co-relation queries the response was YES. [2023-01-27 18:14:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15338 conditions, 5909 events. 3944/5909 cut-off events. For 4120/4476 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 34202 event pairs, 676 based on Foata normal form. 603/6394 useless extension candidates. Maximal degree in co-relation 15323. Up to 3992 conditions per place. [2023-01-27 18:14:23,068 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 74 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-01-27 18:14:23,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 563 flow [2023-01-27 18:14:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-01-27 18:14:23,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2023-01-27 18:14:23,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-01-27 18:14:23,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-01-27 18:14:23,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:23,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-01-27 18:14:23,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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:14:23,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:14:23,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:14:23,076 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 173 flow. Second operand 5 states and 575 transitions. [2023-01-27 18:14:23,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 563 flow [2023-01-27 18:14:23,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 554 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:23,081 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 243 flow [2023-01-27 18:14:23,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-01-27 18:14:23,083 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-01-27 18:14:23,084 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 243 flow [2023-01-27 18:14:23,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:14:23,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:23,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:23,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:14:23,084 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:23,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1916161733, now seen corresponding path program 1 times [2023-01-27 18:14:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187574336] [2023-01-27 18:14:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:23,301 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:14:23,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187574336] [2023-01-27 18:14:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187574336] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:23,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:23,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591834041] [2023-01-27 18:14:23,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:23,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:23,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:23,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:23,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-01-27 18:14:23,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:14:23,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:23,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-01-27 18:14:23,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:24,198 INFO L130 PetriNetUnfolder]: 5782/8691 cut-off events. [2023-01-27 18:14:24,198 INFO L131 PetriNetUnfolder]: For 10372/10619 co-relation queries the response was YES. [2023-01-27 18:14:24,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29937 conditions, 8691 events. 5782/8691 cut-off events. For 10372/10619 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 52901 event pairs, 2333 based on Foata normal form. 259/8779 useless extension candidates. Maximal degree in co-relation 29918. Up to 4656 conditions per place. [2023-01-27 18:14:24,244 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 59 selfloop transitions, 6 changer transitions 6/76 dead transitions. [2023-01-27 18:14:24,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 521 flow [2023-01-27 18:14:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-01-27 18:14:24,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272988505747126 [2023-01-27 18:14:24,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-01-27 18:14:24,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-01-27 18:14:24,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:24,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-01-27 18:14:24,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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:14:24,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:24,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:14:24,250 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 243 flow. Second operand 3 states and 367 transitions. [2023-01-27 18:14:24,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 521 flow [2023-01-27 18:14:24,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:24,268 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 246 flow [2023-01-27 18:14:24,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-01-27 18:14:24,270 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-01-27 18:14:24,270 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 246 flow [2023-01-27 18:14:24,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:14:24,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:24,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:24,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:14:24,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:24,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 940695962, now seen corresponding path program 1 times [2023-01-27 18:14:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910570436] [2023-01-27 18:14:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:24,457 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:14:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910570436] [2023-01-27 18:14:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910570436] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289341550] [2023-01-27 18:14:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:24,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:24,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:24,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:14:24,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:24,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:24,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:25,197 INFO L130 PetriNetUnfolder]: 4088/6462 cut-off events. [2023-01-27 18:14:25,197 INFO L131 PetriNetUnfolder]: For 8225/8635 co-relation queries the response was YES. [2023-01-27 18:14:25,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22324 conditions, 6462 events. 4088/6462 cut-off events. For 8225/8635 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 41633 event pairs, 314 based on Foata normal form. 699/7046 useless extension candidates. Maximal degree in co-relation 22304. Up to 2740 conditions per place. [2023-01-27 18:14:25,237 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 99 selfloop transitions, 18 changer transitions 3/129 dead transitions. [2023-01-27 18:14:25,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 129 transitions, 908 flow [2023-01-27 18:14:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-01-27 18:14:25,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2023-01-27 18:14:25,240 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-01-27 18:14:25,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-01-27 18:14:25,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:25,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-01-27 18:14:25,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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:14:25,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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:14:25,245 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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:14:25,245 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 246 flow. Second operand 7 states and 805 transitions. [2023-01-27 18:14:25,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 129 transitions, 908 flow [2023-01-27 18:14:25,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 129 transitions, 868 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:25,259 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 367 flow [2023-01-27 18:14:25,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-01-27 18:14:25,260 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-01-27 18:14:25,260 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 367 flow [2023-01-27 18:14:25,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:14:25,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:25,261 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:14:25,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:14:25,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:25,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 212284604, now seen corresponding path program 1 times [2023-01-27 18:14:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538280650] [2023-01-27 18:14:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:25,523 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:14:25,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538280650] [2023-01-27 18:14:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538280650] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:25,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831755249] [2023-01-27 18:14:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:25,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:25,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:25,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:14:25,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:25,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:25,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:26,246 INFO L130 PetriNetUnfolder]: 3680/5849 cut-off events. [2023-01-27 18:14:26,246 INFO L131 PetriNetUnfolder]: For 12321/12854 co-relation queries the response was YES. [2023-01-27 18:14:26,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24259 conditions, 5849 events. 3680/5849 cut-off events. For 12321/12854 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 37775 event pairs, 178 based on Foata normal form. 529/6266 useless extension candidates. Maximal degree in co-relation 24235. Up to 2556 conditions per place. [2023-01-27 18:14:26,288 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 108 selfloop transitions, 27 changer transitions 14/158 dead transitions. [2023-01-27 18:14:26,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 158 transitions, 1189 flow [2023-01-27 18:14:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:14:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:14:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1034 transitions. [2023-01-27 18:14:26,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952107279693487 [2023-01-27 18:14:26,292 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1034 transitions. [2023-01-27 18:14:26,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1034 transitions. [2023-01-27 18:14:26,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:26,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1034 transitions. [2023-01-27 18:14:26,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states 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:14:26,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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:14:26,299 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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:14:26,299 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 367 flow. Second operand 9 states and 1034 transitions. [2023-01-27 18:14:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 158 transitions, 1189 flow [2023-01-27 18:14:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 158 transitions, 1140 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:26,527 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 494 flow [2023-01-27 18:14:26,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=494, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2023-01-27 18:14:26,528 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2023-01-27 18:14:26,528 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 494 flow [2023-01-27 18:14:26,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:14:26,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:26,528 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] [2023-01-27 18:14:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:14:26,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:26,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -190215367, now seen corresponding path program 1 times [2023-01-27 18:14:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031041632] [2023-01-27 18:14:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:26,750 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:14:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031041632] [2023-01-27 18:14:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031041632] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:14:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287737629] [2023-01-27 18:14:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:26,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:26,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:26,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 494 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:14:26,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:26,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:26,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:27,454 INFO L130 PetriNetUnfolder]: 3589/5690 cut-off events. [2023-01-27 18:14:27,455 INFO L131 PetriNetUnfolder]: For 15729/16076 co-relation queries the response was YES. [2023-01-27 18:14:27,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24020 conditions, 5690 events. 3589/5690 cut-off events. For 15729/16076 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 36730 event pairs, 168 based on Foata normal form. 308/5886 useless extension candidates. Maximal degree in co-relation 23993. Up to 1566 conditions per place. [2023-01-27 18:14:27,489 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 85 selfloop transitions, 30 changer transitions 38/159 dead transitions. [2023-01-27 18:14:27,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 159 transitions, 1248 flow [2023-01-27 18:14:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:14:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:14:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1241 transitions. [2023-01-27 18:14:27,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862852664576803 [2023-01-27 18:14:27,493 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1241 transitions. [2023-01-27 18:14:27,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1241 transitions. [2023-01-27 18:14:27,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:27,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1241 transitions. [2023-01-27 18:14:27,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.81818181818181) internal successors, (1241), 11 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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:14:27,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states 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:14:27,502 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states 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:14:27,502 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 494 flow. Second operand 11 states and 1241 transitions. [2023-01-27 18:14:27,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 159 transitions, 1248 flow [2023-01-27 18:14:27,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1149 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:27,877 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 434 flow [2023-01-27 18:14:27,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=434, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-01-27 18:14:27,877 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2023-01-27 18:14:27,877 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 434 flow [2023-01-27 18:14:27,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:14:27,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:27,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:27,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:14:27,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:27,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash 505967038, now seen corresponding path program 1 times [2023-01-27 18:14:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:27,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061320674] [2023-01-27 18:14:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:28,099 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:14:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061320674] [2023-01-27 18:14:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061320674] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433120505] [2023-01-27 18:14:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:28,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-01-27 18:14:28,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:14:28,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:28,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-01-27 18:14:28,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:28,635 INFO L130 PetriNetUnfolder]: 2526/4056 cut-off events. [2023-01-27 18:14:28,636 INFO L131 PetriNetUnfolder]: For 11434/11434 co-relation queries the response was YES. [2023-01-27 18:14:28,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17032 conditions, 4056 events. 2526/4056 cut-off events. For 11434/11434 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23328 event pairs, 178 based on Foata normal form. 1/4057 useless extension candidates. Maximal degree in co-relation 17001. Up to 1504 conditions per place. [2023-01-27 18:14:28,651 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 48 selfloop transitions, 11 changer transitions 104/163 dead transitions. [2023-01-27 18:14:28,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 163 transitions, 1590 flow [2023-01-27 18:14:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:14:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:14:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-01-27 18:14:28,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892241379310345 [2023-01-27 18:14:28,654 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-01-27 18:14:28,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-01-27 18:14:28,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:28,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-01-27 18:14:28,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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:14:28,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:14:28,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:14:28,660 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 434 flow. Second operand 6 states and 681 transitions. [2023-01-27 18:14:28,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 163 transitions, 1590 flow [2023-01-27 18:14:28,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 163 transitions, 1244 flow, removed 76 selfloop flow, removed 13 redundant places. [2023-01-27 18:14:28,749 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 253 flow [2023-01-27 18:14:28,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2023-01-27 18:14:28,750 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2023-01-27 18:14:28,750 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 253 flow [2023-01-27 18:14:28,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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:14:28,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:28,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:28,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:14:28,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:28,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:28,751 INFO L85 PathProgramCache]: Analyzing trace with hash -729240840, now seen corresponding path program 2 times [2023-01-27 18:14:28,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782307801] [2023-01-27 18:14:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:29,015 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:14:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782307801] [2023-01-27 18:14:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782307801] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293105459] [2023-01-27 18:14:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:29,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-01-27 18:14:29,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:29,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:29,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-01-27 18:14:29,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:29,184 INFO L130 PetriNetUnfolder]: 573/955 cut-off events. [2023-01-27 18:14:29,185 INFO L131 PetriNetUnfolder]: For 1762/1762 co-relation queries the response was YES. [2023-01-27 18:14:29,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 955 events. 573/955 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4149 event pairs, 116 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 3578. Up to 455 conditions per place. [2023-01-27 18:14:29,189 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 45 selfloop transitions, 6 changer transitions 28/79 dead transitions. [2023-01-27 18:14:29,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 604 flow [2023-01-27 18:14:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:14:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:14:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-01-27 18:14:29,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2023-01-27 18:14:29,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-01-27 18:14:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-01-27 18:14:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:29,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-01-27 18:14:29,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:14:29,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:14:29,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:14:29,194 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 253 flow. Second operand 4 states and 460 transitions. [2023-01-27 18:14:29,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 604 flow [2023-01-27 18:14:29,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 555 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-01-27 18:14:29,204 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 192 flow [2023-01-27 18:14:29,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-01-27 18:14:29,205 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-01-27 18:14:29,205 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 192 flow [2023-01-27 18:14:29,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:29,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:29,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:29,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:14:29,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:29,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2015821044, now seen corresponding path program 3 times [2023-01-27 18:14:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:29,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707054841] [2023-01-27 18:14:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:29,936 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:14:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707054841] [2023-01-27 18:14:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707054841] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308155478] [2023-01-27 18:14:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:29,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:29,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 232 [2023-01-27 18:14:29,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:14:29,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:29,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 232 [2023-01-27 18:14:29,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:30,196 INFO L130 PetriNetUnfolder]: 103/199 cut-off events. [2023-01-27 18:14:30,196 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2023-01-27 18:14:30,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 199 events. 103/199 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 600 event pairs, 1 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 752. Up to 81 conditions per place. [2023-01-27 18:14:30,197 INFO L137 encePairwiseOnDemand]: 221/232 looper letters, 40 selfloop transitions, 9 changer transitions 25/74 dead transitions. [2023-01-27 18:14:30,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 563 flow [2023-01-27 18:14:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:14:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:14:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 795 transitions. [2023-01-27 18:14:30,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42834051724137934 [2023-01-27 18:14:30,200 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 795 transitions. [2023-01-27 18:14:30,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 795 transitions. [2023-01-27 18:14:30,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:30,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 795 transitions. [2023-01-27 18:14:30,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 0 states have call successors, (0), 0 states 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:14:30,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:14:30,205 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:14:30,205 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 192 flow. Second operand 8 states and 795 transitions. [2023-01-27 18:14:30,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 563 flow [2023-01-27 18:14:30,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 492 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-01-27 18:14:30,208 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 173 flow [2023-01-27 18:14:30,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-01-27 18:14:30,210 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-01-27 18:14:30,210 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 173 flow [2023-01-27 18:14:30,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:14:30,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:30,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:30,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:14:30,211 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:30,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2072698180, now seen corresponding path program 4 times [2023-01-27 18:14:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084383923] [2023-01-27 18:14:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:30,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:14:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:30,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:14:30,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:14:30,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:14:30,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:14:30,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:14:30,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:14:30,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:14:30,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:14:30,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:14:30,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:14:30,333 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:30,338 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:14:30,339 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:14:30,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:14:30 BasicIcfg [2023-01-27 18:14:30,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:14:30,408 INFO L158 Benchmark]: Toolchain (without parser) took 17648.34ms. Allocated memory was 362.8MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 320.3MB in the beginning and 610.2MB in the end (delta: -290.0MB). Peak memory consumption was 495.3MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,408 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory was 213.5MB in the beginning and 213.3MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:14:30,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.75ms. Allocated memory is still 362.8MB. Free memory was 320.3MB in the beginning and 297.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.90ms. Allocated memory is still 362.8MB. Free memory was 297.5MB in the beginning and 295.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,409 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 362.8MB. Free memory was 295.0MB in the beginning and 293.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,410 INFO L158 Benchmark]: RCFGBuilder took 622.63ms. Allocated memory is still 362.8MB. Free memory was 293.0MB in the beginning and 325.7MB in the end (delta: -32.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,410 INFO L158 Benchmark]: TraceAbstraction took 16337.30ms. Allocated memory was 362.8MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 324.9MB in the beginning and 610.2MB in the end (delta: -285.3MB). Peak memory consumption was 497.4MB. Max. memory is 16.0GB. [2023-01-27 18:14:30,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory was 213.5MB in the beginning and 213.3MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 579.75ms. Allocated memory is still 362.8MB. Free memory was 320.3MB in the beginning and 297.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.90ms. Allocated memory is still 362.8MB. Free memory was 297.5MB in the beginning and 295.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 362.8MB. Free memory was 295.0MB in the beginning and 293.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 622.63ms. Allocated memory is still 362.8MB. Free memory was 293.0MB in the beginning and 325.7MB in the end (delta: -32.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 16337.30ms. Allocated memory was 362.8MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 324.9MB in the beginning and 610.2MB in the end (delta: -285.3MB). Peak memory consumption was 497.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 132 PlacesBefore, 39 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2620 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6159 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3198, independent: 3031, independent conditional: 0, independent unconditional: 3031, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1443, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3198, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-4, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-3, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-2, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 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: 16.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 20 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=8, InterpolantAutomatonStates: 65, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:14:30,433 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...