/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-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:15:58,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:15:58,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:15:58,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:15:58,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:15:58,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:15:58,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:15:58,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:15:58,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:15:58,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:15:58,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:15:58,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:15:58,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:15:58,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:15:58,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:15:58,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:15:58,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:15:58,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:15:58,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:15:58,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:15:58,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:15:58,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:15:58,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:15:58,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:15:58,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:15:58,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:15:58,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:15:58,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:15:58,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:15:58,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:15:58,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:15:58,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:15:58,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:15:58,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:15:58,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:15:58,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:15:58,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:15:58,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:15:58,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:15:58,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:15:58,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:15:58,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 11:15:58,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:15:58,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:15:58,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:15:58,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:15:58,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:15:58,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:15:58,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:15:58,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:15:58,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:15:58,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:15:58,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 11:15:59,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:15:59,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:15:59,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:15:59,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:15:59,127 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:15:59,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-01-19 11:15:59,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4662ecd/0cccf5fa7ecd4bfca9541b28d67593ab/FLAG3461017ec [2022-01-19 11:15:59,536 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:15:59,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-01-19 11:15:59,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4662ecd/0cccf5fa7ecd4bfca9541b28d67593ab/FLAG3461017ec [2022-01-19 11:15:59,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4662ecd/0cccf5fa7ecd4bfca9541b28d67593ab [2022-01-19 11:15:59,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:15:59,569 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:15:59,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:15:59,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:15:59,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:15:59,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:15:59,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfc710e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59, skipping insertion in model container [2022-01-19 11:15:59,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:15:59,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:15:59,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:15:59,737 WARN L230 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_tso.oepc.i[949,962] [2022-01-19 11:15:59,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:15:59,877 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:15:59,889 WARN L230 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_tso.oepc.i[949,962] [2022-01-19 11:15:59,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:15:59,976 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:15:59,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59 WrapperNode [2022-01-19 11:15:59,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:15:59,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:15:59,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:15:59,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:15:59,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:15:59,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,013 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2022-01-19 11:16:00,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:16:00,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:16:00,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:16:00,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:16:00,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:16:00,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:16:00,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:16:00,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:16:00,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:16:00,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:16:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:16:00,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 11:16:00,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 11:16:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:16:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:16:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:16:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:16:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:16:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:16:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:16:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:16:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:16:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:16:00,091 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:16:00,187 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:16:00,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:16:00,578 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:16:00,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:16:00,807 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:16:00,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:16:00 BoogieIcfgContainer [2022-01-19 11:16:00,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:16:00,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:16:00,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:16:00,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:16:00,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:15:59" (1/3) ... [2022-01-19 11:16:00,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525040d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:16:00, skipping insertion in model container [2022-01-19 11:16:00,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59" (2/3) ... [2022-01-19 11:16:00,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525040d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:16:00, skipping insertion in model container [2022-01-19 11:16:00,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:16:00" (3/3) ... [2022-01-19 11:16:00,814 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-01-19 11:16:00,817 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:16:00,817 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:16:00,817 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:16:00,860 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,861 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,862 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,862 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,862 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,862 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,863 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,874 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,874 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,877 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,877 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,883 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,883 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,883 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,883 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,888 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,888 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,888 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,888 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,888 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,889 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,889 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,892 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:00,894 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:16:00,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:16:00,931 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 11:16:00,931 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:16:00,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-01-19 11:16:00,989 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2022-01-19 11:16:00,989 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:16:00,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-01-19 11:16:00,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-01-19 11:16:00,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-01-19 11:16:01,007 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-01-19 11:16:01,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:16:01,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:01,008 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:01,008 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1118078414, now seen corresponding path program 1 times [2022-01-19 11:16:01,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:01,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31542522] [2022-01-19 11:16:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:01,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:01,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31542522] [2022-01-19 11:16:01,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31542522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:01,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:01,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:16:01,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119176735] [2022-01-19 11:16:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:01,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:16:01,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:01,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:16:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:16:01,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2022-01-19 11:16:01,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:01,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2022-01-19 11:16:01,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:01,464 INFO L129 PetriNetUnfolder]: 57/522 cut-off events. [2022-01-19 11:16:01,464 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 11:16:01,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 522 events. 57/522 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2652 event pairs, 31 based on Foata normal form. 15/507 useless extension candidates. Maximal degree in co-relation 595. Up to 75 conditions per place. [2022-01-19 11:16:01,473 INFO L132 encePairwiseOnDemand]: 129/134 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-01-19 11:16:01,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 131 transitions, 309 flow [2022-01-19 11:16:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:16:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:16:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2022-01-19 11:16:01,486 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2022-01-19 11:16:01,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2022-01-19 11:16:01,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2022-01-19 11:16:01,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:01,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2022-01-19 11:16:01,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,502 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 3 states and 378 transitions. [2022-01-19 11:16:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 131 transitions, 309 flow [2022-01-19 11:16:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:16:01,511 INFO L242 Difference]: Finished difference. Result has 137 places, 126 transitions, 264 flow [2022-01-19 11:16:01,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2022-01-19 11:16:01,514 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, -4 predicate places. [2022-01-19 11:16:01,514 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 264 flow [2022-01-19 11:16:01,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,515 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:01,515 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:01,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:16:01,515 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:01,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1709840169, now seen corresponding path program 1 times [2022-01-19 11:16:01,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:01,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644013418] [2022-01-19 11:16:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:01,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:01,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:01,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644013418] [2022-01-19 11:16:01,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644013418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:01,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:01,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:16:01,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216405373] [2022-01-19 11:16:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:01,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:16:01,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:01,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:16:01,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:16:01,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2022-01-19 11:16:01,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:01,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:01,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2022-01-19 11:16:01,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:02,275 INFO L129 PetriNetUnfolder]: 954/2701 cut-off events. [2022-01-19 11:16:02,275 INFO L130 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-01-19 11:16:02,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2701 events. 954/2701 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 21810 event pairs, 125 based on Foata normal form. 0/2632 useless extension candidates. Maximal degree in co-relation 4268. Up to 816 conditions per place. [2022-01-19 11:16:02,289 INFO L132 encePairwiseOnDemand]: 127/134 looper letters, 24 selfloop transitions, 3 changer transitions 56/177 dead transitions. [2022-01-19 11:16:02,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 177 transitions, 526 flow [2022-01-19 11:16:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:16:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:16:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2022-01-19 11:16:02,293 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2022-01-19 11:16:02,293 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2022-01-19 11:16:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2022-01-19 11:16:02,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:02,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2022-01-19 11:16:02,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,298 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,298 INFO L186 Difference]: Start difference. First operand has 137 places, 126 transitions, 264 flow. Second operand 9 states and 1071 transitions. [2022-01-19 11:16:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 177 transitions, 526 flow [2022-01-19 11:16:02,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 177 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:16:02,303 INFO L242 Difference]: Finished difference. Result has 150 places, 114 transitions, 275 flow [2022-01-19 11:16:02,303 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2022-01-19 11:16:02,303 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 9 predicate places. [2022-01-19 11:16:02,303 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 275 flow [2022-01-19 11:16:02,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,304 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:02,304 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:02,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:16:02,304 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1673744296, now seen corresponding path program 1 times [2022-01-19 11:16:02,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:02,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407983196] [2022-01-19 11:16:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:02,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:02,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407983196] [2022-01-19 11:16:02,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407983196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:02,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:02,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:16:02,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572270749] [2022-01-19 11:16:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:02,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:16:02,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:16:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:16:02,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-01-19 11:16:02,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 275 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:02,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-01-19 11:16:02,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:02,989 INFO L129 PetriNetUnfolder]: 796/1593 cut-off events. [2022-01-19 11:16:02,989 INFO L130 PetriNetUnfolder]: For 1323/1334 co-relation queries the response was YES. [2022-01-19 11:16:02,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 1593 events. 796/1593 cut-off events. For 1323/1334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10377 event pairs, 201 based on Foata normal form. 45/1563 useless extension candidates. Maximal degree in co-relation 3675. Up to 661 conditions per place. [2022-01-19 11:16:03,004 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 21 selfloop transitions, 11 changer transitions 43/169 dead transitions. [2022-01-19 11:16:03,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 569 flow [2022-01-19 11:16:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 11:16:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 11:16:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1713 transitions. [2022-01-19 11:16:03,008 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8522388059701492 [2022-01-19 11:16:03,008 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1713 transitions. [2022-01-19 11:16:03,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1713 transitions. [2022-01-19 11:16:03,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:03,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1713 transitions. [2022-01-19 11:16:03,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.2) internal successors, (1713), 15 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,015 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,015 INFO L186 Difference]: Start difference. First operand has 150 places, 114 transitions, 275 flow. Second operand 15 states and 1713 transitions. [2022-01-19 11:16:03,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 569 flow [2022-01-19 11:16:03,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 169 transitions, 548 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 11:16:03,021 INFO L242 Difference]: Finished difference. Result has 151 places, 121 transitions, 365 flow [2022-01-19 11:16:03,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=365, PETRI_PLACES=151, PETRI_TRANSITIONS=121} [2022-01-19 11:16:03,022 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 10 predicate places. [2022-01-19 11:16:03,022 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 121 transitions, 365 flow [2022-01-19 11:16:03,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:03,023 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:03,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:16:03,023 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1604978853, now seen corresponding path program 1 times [2022-01-19 11:16:03,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:03,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123996317] [2022-01-19 11:16:03,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:03,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:03,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:03,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123996317] [2022-01-19 11:16:03,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123996317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:03,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:03,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:16:03,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949004739] [2022-01-19 11:16:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:03,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:16:03,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:16:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:16:03,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2022-01-19 11:16:03,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 121 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:03,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2022-01-19 11:16:03,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:03,599 INFO L129 PetriNetUnfolder]: 686/1552 cut-off events. [2022-01-19 11:16:03,599 INFO L130 PetriNetUnfolder]: For 4979/5093 co-relation queries the response was YES. [2022-01-19 11:16:03,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1552 events. 686/1552 cut-off events. For 4979/5093 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9976 event pairs, 160 based on Foata normal form. 29/1507 useless extension candidates. Maximal degree in co-relation 5409. Up to 544 conditions per place. [2022-01-19 11:16:03,613 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 32 selfloop transitions, 9 changer transitions 37/173 dead transitions. [2022-01-19 11:16:03,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 173 transitions, 887 flow [2022-01-19 11:16:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:16:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:16:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1615 transitions. [2022-01-19 11:16:03,616 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8608742004264393 [2022-01-19 11:16:03,616 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1615 transitions. [2022-01-19 11:16:03,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1615 transitions. [2022-01-19 11:16:03,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:03,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1615 transitions. [2022-01-19 11:16:03,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.35714285714286) internal successors, (1615), 14 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,621 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,621 INFO L186 Difference]: Start difference. First operand has 151 places, 121 transitions, 365 flow. Second operand 14 states and 1615 transitions. [2022-01-19 11:16:03,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 173 transitions, 887 flow [2022-01-19 11:16:03,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 859 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-01-19 11:16:03,627 INFO L242 Difference]: Finished difference. Result has 160 places, 125 transitions, 442 flow [2022-01-19 11:16:03,627 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=442, PETRI_PLACES=160, PETRI_TRANSITIONS=125} [2022-01-19 11:16:03,627 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 19 predicate places. [2022-01-19 11:16:03,627 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 125 transitions, 442 flow [2022-01-19 11:16:03,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:03,628 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:03,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:16:03,628 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash 535024791, now seen corresponding path program 2 times [2022-01-19 11:16:03,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:03,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407501658] [2022-01-19 11:16:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:03,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:03,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407501658] [2022-01-19 11:16:03,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407501658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:03,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:03,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:16:03,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718633957] [2022-01-19 11:16:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:03,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:16:03,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:16:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:16:03,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-01-19 11:16:03,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 125 transitions, 442 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:03,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:03,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-01-19 11:16:03,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:04,241 INFO L129 PetriNetUnfolder]: 654/1494 cut-off events. [2022-01-19 11:16:04,241 INFO L130 PetriNetUnfolder]: For 10503/10661 co-relation queries the response was YES. [2022-01-19 11:16:04,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6945 conditions, 1494 events. 654/1494 cut-off events. For 10503/10661 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9561 event pairs, 146 based on Foata normal form. 40/1460 useless extension candidates. Maximal degree in co-relation 6859. Up to 536 conditions per place. [2022-01-19 11:16:04,255 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 33 selfloop transitions, 12 changer transitions 37/176 dead transitions. [2022-01-19 11:16:04,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 176 transitions, 1200 flow [2022-01-19 11:16:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 11:16:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 11:16:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1711 transitions. [2022-01-19 11:16:04,258 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8512437810945274 [2022-01-19 11:16:04,258 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1711 transitions. [2022-01-19 11:16:04,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1711 transitions. [2022-01-19 11:16:04,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:04,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1711 transitions. [2022-01-19 11:16:04,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.06666666666666) internal successors, (1711), 15 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,265 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,265 INFO L186 Difference]: Start difference. First operand has 160 places, 125 transitions, 442 flow. Second operand 15 states and 1711 transitions. [2022-01-19 11:16:04,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 176 transitions, 1200 flow [2022-01-19 11:16:04,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 176 transitions, 1121 flow, removed 33 selfloop flow, removed 8 redundant places. [2022-01-19 11:16:04,273 INFO L242 Difference]: Finished difference. Result has 167 places, 128 transitions, 512 flow [2022-01-19 11:16:04,274 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=512, PETRI_PLACES=167, PETRI_TRANSITIONS=128} [2022-01-19 11:16:04,275 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 26 predicate places. [2022-01-19 11:16:04,276 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 128 transitions, 512 flow [2022-01-19 11:16:04,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,276 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:04,276 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:04,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:16:04,276 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 356554085, now seen corresponding path program 1 times [2022-01-19 11:16:04,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90259729] [2022-01-19 11:16:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:04,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:04,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90259729] [2022-01-19 11:16:04,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90259729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:04,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:04,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:16:04,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673940983] [2022-01-19 11:16:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:04,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:16:04,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:16:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:16:04,487 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2022-01-19 11:16:04,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 128 transitions, 512 flow. Second operand has 13 states, 13 states have (on average 108.46153846153847) internal successors, (1410), 13 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:04,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2022-01-19 11:16:04,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:04,948 INFO L129 PetriNetUnfolder]: 520/1238 cut-off events. [2022-01-19 11:16:04,948 INFO L130 PetriNetUnfolder]: For 13899/14147 co-relation queries the response was YES. [2022-01-19 11:16:04,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6517 conditions, 1238 events. 520/1238 cut-off events. For 13899/14147 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7885 event pairs, 138 based on Foata normal form. 23/1189 useless extension candidates. Maximal degree in co-relation 6423. Up to 530 conditions per place. [2022-01-19 11:16:04,964 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 36 selfloop transitions, 14 changer transitions 25/167 dead transitions. [2022-01-19 11:16:04,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 1209 flow [2022-01-19 11:16:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 11:16:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 11:16:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1885 transitions. [2022-01-19 11:16:04,967 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8274802458296752 [2022-01-19 11:16:04,967 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1885 transitions. [2022-01-19 11:16:04,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1885 transitions. [2022-01-19 11:16:04,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:04,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1885 transitions. [2022-01-19 11:16:04,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 110.88235294117646) internal successors, (1885), 17 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,974 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,974 INFO L186 Difference]: Start difference. First operand has 167 places, 128 transitions, 512 flow. Second operand 17 states and 1885 transitions. [2022-01-19 11:16:04,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 1209 flow [2022-01-19 11:16:04,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 167 transitions, 1027 flow, removed 83 selfloop flow, removed 12 redundant places. [2022-01-19 11:16:04,983 INFO L242 Difference]: Finished difference. Result has 172 places, 130 transitions, 540 flow [2022-01-19 11:16:04,983 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=540, PETRI_PLACES=172, PETRI_TRANSITIONS=130} [2022-01-19 11:16:04,984 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 31 predicate places. [2022-01-19 11:16:04,984 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 130 transitions, 540 flow [2022-01-19 11:16:04,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.46153846153847) internal successors, (1410), 13 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:04,984 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:04,985 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:04,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:16:04,985 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1902008150, now seen corresponding path program 1 times [2022-01-19 11:16:04,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:04,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138730981] [2022-01-19 11:16:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:04,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:05,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:05,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138730981] [2022-01-19 11:16:05,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138730981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:05,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:05,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:16:05,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474516697] [2022-01-19 11:16:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:05,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:16:05,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:16:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:16:05,132 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-01-19 11:16:05,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 130 transitions, 540 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:05,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-01-19 11:16:05,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:05,497 INFO L129 PetriNetUnfolder]: 606/1332 cut-off events. [2022-01-19 11:16:05,497 INFO L130 PetriNetUnfolder]: For 16130/16591 co-relation queries the response was YES. [2022-01-19 11:16:05,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1332 events. 606/1332 cut-off events. For 16130/16591 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8453 event pairs, 69 based on Foata normal form. 48/1310 useless extension candidates. Maximal degree in co-relation 7151. Up to 566 conditions per place. [2022-01-19 11:16:05,516 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 31 selfloop transitions, 12 changer transitions 29/166 dead transitions. [2022-01-19 11:16:05,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 1142 flow [2022-01-19 11:16:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2022-01-19 11:16:05,519 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484500574052812 [2022-01-19 11:16:05,519 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:05,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,525 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,525 INFO L186 Difference]: Start difference. First operand has 172 places, 130 transitions, 540 flow. Second operand 13 states and 1478 transitions. [2022-01-19 11:16:05,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 1142 flow [2022-01-19 11:16:05,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 166 transitions, 1012 flow, removed 58 selfloop flow, removed 14 redundant places. [2022-01-19 11:16:05,540 INFO L242 Difference]: Finished difference. Result has 168 places, 132 transitions, 580 flow [2022-01-19 11:16:05,540 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=580, PETRI_PLACES=168, PETRI_TRANSITIONS=132} [2022-01-19 11:16:05,540 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 27 predicate places. [2022-01-19 11:16:05,540 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 132 transitions, 580 flow [2022-01-19 11:16:05,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:05,541 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:05,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:16:05,542 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:05,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash -191689699, now seen corresponding path program 1 times [2022-01-19 11:16:05,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:05,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066807767] [2022-01-19 11:16:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:05,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:05,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:05,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066807767] [2022-01-19 11:16:05,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066807767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:05,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:05,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:16:05,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349114108] [2022-01-19 11:16:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:05,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:16:05,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:16:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:16:05,711 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-01-19 11:16:05,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 132 transitions, 580 flow. Second operand has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:05,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:05,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-01-19 11:16:05,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:06,045 INFO L129 PetriNetUnfolder]: 528/1282 cut-off events. [2022-01-19 11:16:06,045 INFO L130 PetriNetUnfolder]: For 16509/16796 co-relation queries the response was YES. [2022-01-19 11:16:06,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7177 conditions, 1282 events. 528/1282 cut-off events. For 16509/16796 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7977 event pairs, 107 based on Foata normal form. 59/1281 useless extension candidates. Maximal degree in co-relation 7083. Up to 499 conditions per place. [2022-01-19 11:16:06,059 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 39 selfloop transitions, 15 changer transitions 13/161 dead transitions. [2022-01-19 11:16:06,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 161 transitions, 1130 flow [2022-01-19 11:16:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:16:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:16:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1036 transitions. [2022-01-19 11:16:06,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8590381426202321 [2022-01-19 11:16:06,061 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1036 transitions. [2022-01-19 11:16:06,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1036 transitions. [2022-01-19 11:16:06,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:06,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1036 transitions. [2022-01-19 11:16:06,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,065 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,065 INFO L186 Difference]: Start difference. First operand has 168 places, 132 transitions, 580 flow. Second operand 9 states and 1036 transitions. [2022-01-19 11:16:06,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 161 transitions, 1130 flow [2022-01-19 11:16:06,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 1073 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-01-19 11:16:06,072 INFO L242 Difference]: Finished difference. Result has 166 places, 136 transitions, 650 flow [2022-01-19 11:16:06,073 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=650, PETRI_PLACES=166, PETRI_TRANSITIONS=136} [2022-01-19 11:16:06,073 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 25 predicate places. [2022-01-19 11:16:06,073 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 136 transitions, 650 flow [2022-01-19 11:16:06,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,074 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:06,074 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:06,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:16:06,074 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:06,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1157214247, now seen corresponding path program 2 times [2022-01-19 11:16:06,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:06,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098196173] [2022-01-19 11:16:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:06,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:06,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098196173] [2022-01-19 11:16:06,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098196173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:06,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:06,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:16:06,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616202159] [2022-01-19 11:16:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:06,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:16:06,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:16:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:16:06,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:06,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 136 transitions, 650 flow. Second operand has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:06,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:06,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:06,632 INFO L129 PetriNetUnfolder]: 550/1364 cut-off events. [2022-01-19 11:16:06,632 INFO L130 PetriNetUnfolder]: For 19946/20223 co-relation queries the response was YES. [2022-01-19 11:16:06,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8003 conditions, 1364 events. 550/1364 cut-off events. For 19946/20223 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8635 event pairs, 98 based on Foata normal form. 47/1344 useless extension candidates. Maximal degree in co-relation 7909. Up to 506 conditions per place. [2022-01-19 11:16:06,652 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 41 selfloop transitions, 17 changer transitions 25/176 dead transitions. [2022-01-19 11:16:06,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 176 transitions, 1488 flow [2022-01-19 11:16:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:16:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:16:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1365 transitions. [2022-01-19 11:16:06,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8488805970149254 [2022-01-19 11:16:06,655 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1365 transitions. [2022-01-19 11:16:06,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1365 transitions. [2022-01-19 11:16:06,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:06,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1365 transitions. [2022-01-19 11:16:06,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.75) internal successors, (1365), 12 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,660 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,660 INFO L186 Difference]: Start difference. First operand has 166 places, 136 transitions, 650 flow. Second operand 12 states and 1365 transitions. [2022-01-19 11:16:06,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 176 transitions, 1488 flow [2022-01-19 11:16:06,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 176 transitions, 1263 flow, removed 100 selfloop flow, removed 10 redundant places. [2022-01-19 11:16:06,672 INFO L242 Difference]: Finished difference. Result has 171 places, 139 transitions, 676 flow [2022-01-19 11:16:06,673 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=676, PETRI_PLACES=171, PETRI_TRANSITIONS=139} [2022-01-19 11:16:06,673 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 30 predicate places. [2022-01-19 11:16:06,673 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 139 transitions, 676 flow [2022-01-19 11:16:06,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,674 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:06,674 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:06,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:16:06,674 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash -575840605, now seen corresponding path program 3 times [2022-01-19 11:16:06,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:06,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64100237] [2022-01-19 11:16:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:06,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:06,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64100237] [2022-01-19 11:16:06,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64100237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:06,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:06,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 11:16:06,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888397280] [2022-01-19 11:16:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:06,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 11:16:06,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:06,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 11:16:06,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 11:16:06,858 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:06,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 139 transitions, 676 flow. Second operand has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:06,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:06,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:06,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:07,347 INFO L129 PetriNetUnfolder]: 556/1376 cut-off events. [2022-01-19 11:16:07,347 INFO L130 PetriNetUnfolder]: For 24023/24263 co-relation queries the response was YES. [2022-01-19 11:16:07,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8681 conditions, 1376 events. 556/1376 cut-off events. For 24023/24263 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8707 event pairs, 98 based on Foata normal form. 47/1356 useless extension candidates. Maximal degree in co-relation 8586. Up to 511 conditions per place. [2022-01-19 11:16:07,362 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 39 selfloop transitions, 22 changer transitions 25/179 dead transitions. [2022-01-19 11:16:07,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 1618 flow [2022-01-19 11:16:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1473 transitions. [2022-01-19 11:16:07,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8455797933409873 [2022-01-19 11:16:07,365 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1473 transitions. [2022-01-19 11:16:07,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1473 transitions. [2022-01-19 11:16:07,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:07,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1473 transitions. [2022-01-19 11:16:07,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.3076923076923) internal successors, (1473), 13 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,369 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,369 INFO L186 Difference]: Start difference. First operand has 171 places, 139 transitions, 676 flow. Second operand 13 states and 1473 transitions. [2022-01-19 11:16:07,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 1618 flow [2022-01-19 11:16:07,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 179 transitions, 1529 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-01-19 11:16:07,380 INFO L242 Difference]: Finished difference. Result has 177 places, 142 transitions, 772 flow [2022-01-19 11:16:07,380 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=772, PETRI_PLACES=177, PETRI_TRANSITIONS=142} [2022-01-19 11:16:07,381 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 36 predicate places. [2022-01-19 11:16:07,381 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 142 transitions, 772 flow [2022-01-19 11:16:07,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,382 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:07,382 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:16:07,382 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -165882011, now seen corresponding path program 4 times [2022-01-19 11:16:07,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:07,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586927138] [2022-01-19 11:16:07,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:07,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:07,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586927138] [2022-01-19 11:16:07,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586927138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:07,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:07,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:16:07,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576382147] [2022-01-19 11:16:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:07,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:16:07,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:07,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:16:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:16:07,520 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:07,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 142 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:07,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:07,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:07,952 INFO L129 PetriNetUnfolder]: 612/1335 cut-off events. [2022-01-19 11:16:07,952 INFO L130 PetriNetUnfolder]: For 44164/44941 co-relation queries the response was YES. [2022-01-19 11:16:07,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11415 conditions, 1335 events. 612/1335 cut-off events. For 44164/44941 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8163 event pairs, 53 based on Foata normal form. 37/1313 useless extension candidates. Maximal degree in co-relation 11315. Up to 515 conditions per place. [2022-01-19 11:16:07,968 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 54 selfloop transitions, 13 changer transitions 25/185 dead transitions. [2022-01-19 11:16:07,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 185 transitions, 1978 flow [2022-01-19 11:16:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:16:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:16:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1363 transitions. [2022-01-19 11:16:07,970 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847636815920398 [2022-01-19 11:16:07,970 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1363 transitions. [2022-01-19 11:16:07,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1363 transitions. [2022-01-19 11:16:07,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:07,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1363 transitions. [2022-01-19 11:16:07,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.58333333333333) internal successors, (1363), 12 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,973 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,973 INFO L186 Difference]: Start difference. First operand has 177 places, 142 transitions, 772 flow. Second operand 12 states and 1363 transitions. [2022-01-19 11:16:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 185 transitions, 1978 flow [2022-01-19 11:16:07,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 185 transitions, 1485 flow, removed 230 selfloop flow, removed 14 redundant places. [2022-01-19 11:16:07,988 INFO L242 Difference]: Finished difference. Result has 175 places, 145 transitions, 759 flow [2022-01-19 11:16:07,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=759, PETRI_PLACES=175, PETRI_TRANSITIONS=145} [2022-01-19 11:16:07,989 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 34 predicate places. [2022-01-19 11:16:07,989 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 759 flow [2022-01-19 11:16:07,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:07,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:07,990 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:07,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:16:07,990 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1321921059, now seen corresponding path program 1 times [2022-01-19 11:16:07,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:07,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258424775] [2022-01-19 11:16:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:07,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:08,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:08,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258424775] [2022-01-19 11:16:08,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258424775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:08,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:08,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:16:08,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419055984] [2022-01-19 11:16:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:08,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:16:08,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:16:08,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:16:08,131 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:08,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 145 transitions, 759 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:08,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:08,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:08,546 INFO L129 PetriNetUnfolder]: 528/1270 cut-off events. [2022-01-19 11:16:08,547 INFO L130 PetriNetUnfolder]: For 26503/27140 co-relation queries the response was YES. [2022-01-19 11:16:08,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8909 conditions, 1270 events. 528/1270 cut-off events. For 26503/27140 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7918 event pairs, 41 based on Foata normal form. 54/1259 useless extension candidates. Maximal degree in co-relation 8812. Up to 510 conditions per place. [2022-01-19 11:16:08,564 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 47 selfloop transitions, 30 changer transitions 19/189 dead transitions. [2022-01-19 11:16:08,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 189 transitions, 1792 flow [2022-01-19 11:16:08,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:16:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:16:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1584 transitions. [2022-01-19 11:16:08,566 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8443496801705757 [2022-01-19 11:16:08,566 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1584 transitions. [2022-01-19 11:16:08,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1584 transitions. [2022-01-19 11:16:08,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:08,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1584 transitions. [2022-01-19 11:16:08,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.14285714285714) internal successors, (1584), 14 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,570 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,570 INFO L186 Difference]: Start difference. First operand has 175 places, 145 transitions, 759 flow. Second operand 14 states and 1584 transitions. [2022-01-19 11:16:08,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 189 transitions, 1792 flow [2022-01-19 11:16:08,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 189 transitions, 1585 flow, removed 99 selfloop flow, removed 9 redundant places. [2022-01-19 11:16:08,586 INFO L242 Difference]: Finished difference. Result has 181 places, 151 transitions, 944 flow [2022-01-19 11:16:08,586 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=944, PETRI_PLACES=181, PETRI_TRANSITIONS=151} [2022-01-19 11:16:08,586 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 40 predicate places. [2022-01-19 11:16:08,586 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 151 transitions, 944 flow [2022-01-19 11:16:08,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,587 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:08,587 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:08,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:16:08,587 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash 751659821, now seen corresponding path program 2 times [2022-01-19 11:16:08,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:08,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588655088] [2022-01-19 11:16:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:08,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:08,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:08,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588655088] [2022-01-19 11:16:08,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588655088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:08,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:08,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:16:08,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219219902] [2022-01-19 11:16:08,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:08,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:16:08,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:16:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:16:08,745 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2022-01-19 11:16:08,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 151 transitions, 944 flow. Second operand has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:08,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:08,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2022-01-19 11:16:08,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:09,129 INFO L129 PetriNetUnfolder]: 544/1316 cut-off events. [2022-01-19 11:16:09,130 INFO L130 PetriNetUnfolder]: For 27405/28947 co-relation queries the response was YES. [2022-01-19 11:16:09,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9455 conditions, 1316 events. 544/1316 cut-off events. For 27405/28947 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8648 event pairs, 59 based on Foata normal form. 38/1289 useless extension candidates. Maximal degree in co-relation 9353. Up to 617 conditions per place. [2022-01-19 11:16:09,165 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 57 selfloop transitions, 18 changer transitions 19/185 dead transitions. [2022-01-19 11:16:09,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 185 transitions, 1866 flow [2022-01-19 11:16:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1443 transitions. [2022-01-19 11:16:09,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2022-01-19 11:16:09,167 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1443 transitions. [2022-01-19 11:16:09,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1443 transitions. [2022-01-19 11:16:09,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:09,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1443 transitions. [2022-01-19 11:16:09,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.0) internal successors, (1443), 13 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,170 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,170 INFO L186 Difference]: Start difference. First operand has 181 places, 151 transitions, 944 flow. Second operand 13 states and 1443 transitions. [2022-01-19 11:16:09,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 185 transitions, 1866 flow [2022-01-19 11:16:09,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 185 transitions, 1651 flow, removed 99 selfloop flow, removed 10 redundant places. [2022-01-19 11:16:09,187 INFO L242 Difference]: Finished difference. Result has 184 places, 153 transitions, 978 flow [2022-01-19 11:16:09,187 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=978, PETRI_PLACES=184, PETRI_TRANSITIONS=153} [2022-01-19 11:16:09,187 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 43 predicate places. [2022-01-19 11:16:09,187 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 153 transitions, 978 flow [2022-01-19 11:16:09,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:09,188 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:09,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 11:16:09,188 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 662389671, now seen corresponding path program 3 times [2022-01-19 11:16:09,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:09,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144508791] [2022-01-19 11:16:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:09,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:09,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144508791] [2022-01-19 11:16:09,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144508791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:09,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:09,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:16:09,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675352187] [2022-01-19 11:16:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:09,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:16:09,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:09,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:16:09,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:16:09,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2022-01-19 11:16:09,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 153 transitions, 978 flow. Second operand has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:09,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2022-01-19 11:16:09,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:09,888 INFO L129 PetriNetUnfolder]: 546/1406 cut-off events. [2022-01-19 11:16:09,888 INFO L130 PetriNetUnfolder]: For 29779/30276 co-relation queries the response was YES. [2022-01-19 11:16:09,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9595 conditions, 1406 events. 546/1406 cut-off events. For 29779/30276 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9258 event pairs, 90 based on Foata normal form. 79/1413 useless extension candidates. Maximal degree in co-relation 9491. Up to 614 conditions per place. [2022-01-19 11:16:09,908 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 53 selfloop transitions, 24 changer transitions 19/187 dead transitions. [2022-01-19 11:16:09,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 1938 flow [2022-01-19 11:16:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:16:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:16:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1549 transitions. [2022-01-19 11:16:09,910 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8256929637526652 [2022-01-19 11:16:09,910 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1549 transitions. [2022-01-19 11:16:09,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1549 transitions. [2022-01-19 11:16:09,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:09,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1549 transitions. [2022-01-19 11:16:09,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.64285714285714) internal successors, (1549), 14 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,914 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,914 INFO L186 Difference]: Start difference. First operand has 184 places, 153 transitions, 978 flow. Second operand 14 states and 1549 transitions. [2022-01-19 11:16:09,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 1938 flow [2022-01-19 11:16:09,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 187 transitions, 1717 flow, removed 96 selfloop flow, removed 11 redundant places. [2022-01-19 11:16:09,933 INFO L242 Difference]: Finished difference. Result has 187 places, 155 transitions, 1027 flow [2022-01-19 11:16:09,933 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1027, PETRI_PLACES=187, PETRI_TRANSITIONS=155} [2022-01-19 11:16:09,934 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2022-01-19 11:16:09,934 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 155 transitions, 1027 flow [2022-01-19 11:16:09,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:09,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:09,934 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:09,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 11:16:09,934 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 347658729, now seen corresponding path program 4 times [2022-01-19 11:16:09,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:09,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670481683] [2022-01-19 11:16:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:09,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:10,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:10,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670481683] [2022-01-19 11:16:10,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670481683] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:10,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:10,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:16:10,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371820079] [2022-01-19 11:16:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:10,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:16:10,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:16:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:16:10,084 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2022-01-19 11:16:10,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 155 transitions, 1027 flow. Second operand has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:10,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2022-01-19 11:16:10,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:10,571 INFO L129 PetriNetUnfolder]: 564/1468 cut-off events. [2022-01-19 11:16:10,571 INFO L130 PetriNetUnfolder]: For 32992/34159 co-relation queries the response was YES. [2022-01-19 11:16:10,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10332 conditions, 1468 events. 564/1468 cut-off events. For 32992/34159 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10248 event pairs, 53 based on Foata normal form. 31/1434 useless extension candidates. Maximal degree in co-relation 10226. Up to 498 conditions per place. [2022-01-19 11:16:10,593 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 64 selfloop transitions, 17 changer transitions 19/191 dead transitions. [2022-01-19 11:16:10,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 2065 flow [2022-01-19 11:16:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1441 transitions. [2022-01-19 11:16:10,596 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8272101033295063 [2022-01-19 11:16:10,596 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1441 transitions. [2022-01-19 11:16:10,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1441 transitions. [2022-01-19 11:16:10,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:10,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1441 transitions. [2022-01-19 11:16:10,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.84615384615384) internal successors, (1441), 13 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,600 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,600 INFO L186 Difference]: Start difference. First operand has 187 places, 155 transitions, 1027 flow. Second operand 13 states and 1441 transitions. [2022-01-19 11:16:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 2065 flow [2022-01-19 11:16:10,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 191 transitions, 1799 flow, removed 115 selfloop flow, removed 12 redundant places. [2022-01-19 11:16:10,618 INFO L242 Difference]: Finished difference. Result has 188 places, 157 transitions, 1060 flow [2022-01-19 11:16:10,618 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1060, PETRI_PLACES=188, PETRI_TRANSITIONS=157} [2022-01-19 11:16:10,619 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 47 predicate places. [2022-01-19 11:16:10,619 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 157 transitions, 1060 flow [2022-01-19 11:16:10,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,619 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:10,619 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:10,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 11:16:10,620 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1063553185, now seen corresponding path program 1 times [2022-01-19 11:16:10,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091721823] [2022-01-19 11:16:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:10,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:10,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:10,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091721823] [2022-01-19 11:16:10,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091721823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:10,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:10,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:16:10,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45665259] [2022-01-19 11:16:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:10,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:16:10,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:16:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:16:10,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:10,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 157 transitions, 1060 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:10,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:10,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:10,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:12,414 INFO L129 PetriNetUnfolder]: 7299/12583 cut-off events. [2022-01-19 11:16:12,415 INFO L130 PetriNetUnfolder]: For 263060/265667 co-relation queries the response was YES. [2022-01-19 11:16:12,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68985 conditions, 12583 events. 7299/12583 cut-off events. For 263060/265667 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 98969 event pairs, 352 based on Foata normal form. 1034/13151 useless extension candidates. Maximal degree in co-relation 68885. Up to 4591 conditions per place. [2022-01-19 11:16:12,606 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 240 selfloop transitions, 18 changer transitions 12/365 dead transitions. [2022-01-19 11:16:12,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 365 transitions, 4689 flow [2022-01-19 11:16:12,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:16:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:16:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1172 transitions. [2022-01-19 11:16:12,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8746268656716418 [2022-01-19 11:16:12,608 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1172 transitions. [2022-01-19 11:16:12,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1172 transitions. [2022-01-19 11:16:12,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:12,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1172 transitions. [2022-01-19 11:16:12,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.2) internal successors, (1172), 10 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:12,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:12,611 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:12,612 INFO L186 Difference]: Start difference. First operand has 188 places, 157 transitions, 1060 flow. Second operand 10 states and 1172 transitions. [2022-01-19 11:16:12,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 365 transitions, 4689 flow [2022-01-19 11:16:12,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 365 transitions, 4319 flow, removed 134 selfloop flow, removed 11 redundant places. [2022-01-19 11:16:12,677 INFO L242 Difference]: Finished difference. Result has 186 places, 173 transitions, 1123 flow [2022-01-19 11:16:12,678 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1123, PETRI_PLACES=186, PETRI_TRANSITIONS=173} [2022-01-19 11:16:12,679 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 45 predicate places. [2022-01-19 11:16:12,679 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 173 transitions, 1123 flow [2022-01-19 11:16:12,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:12,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:12,679 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:12,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 11:16:12,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash -70393184, now seen corresponding path program 1 times [2022-01-19 11:16:12,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:12,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136264675] [2022-01-19 11:16:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:12,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:12,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136264675] [2022-01-19 11:16:12,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136264675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:12,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:12,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:12,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669483477] [2022-01-19 11:16:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:12,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:12,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:12,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:12,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:12,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:12,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 173 transitions, 1123 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:12,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:12,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:12,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:14,465 INFO L129 PetriNetUnfolder]: 6626/11960 cut-off events. [2022-01-19 11:16:14,465 INFO L130 PetriNetUnfolder]: For 195485/198283 co-relation queries the response was YES. [2022-01-19 11:16:14,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68137 conditions, 11960 events. 6626/11960 cut-off events. For 195485/198283 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 100002 event pairs, 148 based on Foata normal form. 1308/13044 useless extension candidates. Maximal degree in co-relation 68038. Up to 3132 conditions per place. [2022-01-19 11:16:14,671 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 269 selfloop transitions, 36 changer transitions 40/440 dead transitions. [2022-01-19 11:16:14,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 440 transitions, 5748 flow [2022-01-19 11:16:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-01-19 11:16:14,673 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754305396096441 [2022-01-19 11:16:14,673 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2022-01-19 11:16:14,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2022-01-19 11:16:14,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:14,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2022-01-19 11:16:14,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:14,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:14,677 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:14,677 INFO L186 Difference]: Start difference. First operand has 186 places, 173 transitions, 1123 flow. Second operand 13 states and 1525 transitions. [2022-01-19 11:16:14,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 440 transitions, 5748 flow [2022-01-19 11:16:14,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 440 transitions, 5746 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:16:14,781 INFO L242 Difference]: Finished difference. Result has 203 places, 189 transitions, 1354 flow [2022-01-19 11:16:14,782 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1354, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2022-01-19 11:16:14,782 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 62 predicate places. [2022-01-19 11:16:14,782 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 1354 flow [2022-01-19 11:16:14,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:14,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:14,783 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:14,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 11:16:14,783 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 630994345, now seen corresponding path program 1 times [2022-01-19 11:16:14,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:14,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191030462] [2022-01-19 11:16:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:14,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:14,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191030462] [2022-01-19 11:16:14,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191030462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:14,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:14,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:16:14,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481601653] [2022-01-19 11:16:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:14,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:16:14,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:16:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:16:14,844 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2022-01-19 11:16:14,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 1354 flow. Second operand has 6 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) [2022-01-19 11:16:14,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:14,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2022-01-19 11:16:14,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:16,286 INFO L129 PetriNetUnfolder]: 2490/8635 cut-off events. [2022-01-19 11:16:16,286 INFO L130 PetriNetUnfolder]: For 62976/70969 co-relation queries the response was YES. [2022-01-19 11:16:16,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37722 conditions, 8635 events. 2490/8635 cut-off events. For 62976/70969 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 106079 event pairs, 326 based on Foata normal form. 199/8234 useless extension candidates. Maximal degree in co-relation 37615. Up to 2397 conditions per place. [2022-01-19 11:16:16,385 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 130 selfloop transitions, 11 changer transitions 22/297 dead transitions. [2022-01-19 11:16:16,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 297 transitions, 3565 flow [2022-01-19 11:16:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:16:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:16:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1063 transitions. [2022-01-19 11:16:16,387 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814262023217247 [2022-01-19 11:16:16,387 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1063 transitions. [2022-01-19 11:16:16,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1063 transitions. [2022-01-19 11:16:16,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:16,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1063 transitions. [2022-01-19 11:16:16,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:16,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:16,389 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:16,390 INFO L186 Difference]: Start difference. First operand has 203 places, 189 transitions, 1354 flow. Second operand 9 states and 1063 transitions. [2022-01-19 11:16:16,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 297 transitions, 3565 flow [2022-01-19 11:16:16,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 297 transitions, 3464 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-01-19 11:16:16,715 INFO L242 Difference]: Finished difference. Result has 214 places, 197 transitions, 1406 flow [2022-01-19 11:16:16,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1406, PETRI_PLACES=214, PETRI_TRANSITIONS=197} [2022-01-19 11:16:16,715 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 73 predicate places. [2022-01-19 11:16:16,716 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 197 transitions, 1406 flow [2022-01-19 11:16:16,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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) [2022-01-19 11:16:16,716 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:16,716 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:16,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 11:16:16,716 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 145875966, now seen corresponding path program 1 times [2022-01-19 11:16:16,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:16,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812735549] [2022-01-19 11:16:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:16,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:16,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:16,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812735549] [2022-01-19 11:16:16,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812735549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:16,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:16,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:16:16,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330127018] [2022-01-19 11:16:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:16,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:16:16,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:16:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:16:16,829 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:16,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 197 transitions, 1406 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:16,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:16,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:16,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:19,556 INFO L129 PetriNetUnfolder]: 9046/16577 cut-off events. [2022-01-19 11:16:19,556 INFO L130 PetriNetUnfolder]: For 288284/292387 co-relation queries the response was YES. [2022-01-19 11:16:19,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97391 conditions, 16577 events. 9046/16577 cut-off events. For 288284/292387 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 152333 event pairs, 93 based on Foata normal form. 2071/18336 useless extension candidates. Maximal degree in co-relation 97278. Up to 3080 conditions per place. [2022-01-19 11:16:19,663 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 124 selfloop transitions, 25 changer transitions 227/470 dead transitions. [2022-01-19 11:16:19,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 470 transitions, 6436 flow [2022-01-19 11:16:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:16:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:16:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2022-01-19 11:16:19,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759328358208955 [2022-01-19 11:16:19,665 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2022-01-19 11:16:19,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2022-01-19 11:16:19,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:19,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2022-01-19 11:16:19,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:19,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:19,669 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:19,669 INFO L186 Difference]: Start difference. First operand has 214 places, 197 transitions, 1406 flow. Second operand 16 states and 1878 transitions. [2022-01-19 11:16:19,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 470 transitions, 6436 flow [2022-01-19 11:16:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 470 transitions, 5784 flow, removed 146 selfloop flow, removed 11 redundant places. [2022-01-19 11:16:20,123 INFO L242 Difference]: Finished difference. Result has 225 places, 163 transitions, 1100 flow [2022-01-19 11:16:20,124 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1100, PETRI_PLACES=225, PETRI_TRANSITIONS=163} [2022-01-19 11:16:20,124 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 84 predicate places. [2022-01-19 11:16:20,124 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 163 transitions, 1100 flow [2022-01-19 11:16:20,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:20,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:20,124 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:20,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 11:16:20,125 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -592772304, now seen corresponding path program 1 times [2022-01-19 11:16:20,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924452483] [2022-01-19 11:16:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:20,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:20,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:20,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924452483] [2022-01-19 11:16:20,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924452483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:20,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:20,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:16:20,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898348008] [2022-01-19 11:16:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:20,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:16:20,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:16:20,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:16:20,226 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-01-19 11:16:20,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 163 transitions, 1100 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:20,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:20,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-01-19 11:16:20,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:21,754 INFO L129 PetriNetUnfolder]: 4361/9096 cut-off events. [2022-01-19 11:16:21,754 INFO L130 PetriNetUnfolder]: For 139358/140770 co-relation queries the response was YES. [2022-01-19 11:16:21,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53532 conditions, 9096 events. 4361/9096 cut-off events. For 139358/140770 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 89161 event pairs, 76 based on Foata normal form. 705/9613 useless extension candidates. Maximal degree in co-relation 53471. Up to 1876 conditions per place. [2022-01-19 11:16:21,819 INFO L132 encePairwiseOnDemand]: 124/134 looper letters, 105 selfloop transitions, 29 changer transitions 124/352 dead transitions. [2022-01-19 11:16:21,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 352 transitions, 4268 flow [2022-01-19 11:16:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:16:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:16:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2022-01-19 11:16:21,833 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8558768656716418 [2022-01-19 11:16:21,833 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2022-01-19 11:16:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2022-01-19 11:16:21,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:21,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2022-01-19 11:16:21,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:21,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:21,837 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:21,837 INFO L186 Difference]: Start difference. First operand has 225 places, 163 transitions, 1100 flow. Second operand 16 states and 1835 transitions. [2022-01-19 11:16:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 352 transitions, 4268 flow [2022-01-19 11:16:22,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 352 transitions, 3503 flow, removed 338 selfloop flow, removed 26 redundant places. [2022-01-19 11:16:22,195 INFO L242 Difference]: Finished difference. Result has 205 places, 162 transitions, 925 flow [2022-01-19 11:16:22,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=925, PETRI_PLACES=205, PETRI_TRANSITIONS=162} [2022-01-19 11:16:22,196 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 64 predicate places. [2022-01-19 11:16:22,196 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 162 transitions, 925 flow [2022-01-19 11:16:22,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:22,196 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:22,196 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:22,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 11:16:22,197 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 727786334, now seen corresponding path program 1 times [2022-01-19 11:16:22,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:22,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373425874] [2022-01-19 11:16:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:22,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:22,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373425874] [2022-01-19 11:16:22,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373425874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:22,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:22,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:22,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317927264] [2022-01-19 11:16:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:22,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:22,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:22,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:22,270 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2022-01-19 11:16:22,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 162 transitions, 925 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:22,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:22,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2022-01-19 11:16:22,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:23,042 INFO L129 PetriNetUnfolder]: 1259/5316 cut-off events. [2022-01-19 11:16:23,042 INFO L130 PetriNetUnfolder]: For 19085/20943 co-relation queries the response was YES. [2022-01-19 11:16:23,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 5316 events. 1259/5316 cut-off events. For 19085/20943 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 67162 event pairs, 37 based on Foata normal form. 37/4866 useless extension candidates. Maximal degree in co-relation 18519. Up to 963 conditions per place. [2022-01-19 11:16:23,100 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 68 selfloop transitions, 2 changer transitions 5/198 dead transitions. [2022-01-19 11:16:23,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 198 transitions, 1407 flow [2022-01-19 11:16:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:16:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:16:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2022-01-19 11:16:23,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8550106609808102 [2022-01-19 11:16:23,112 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2022-01-19 11:16:23,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2022-01-19 11:16:23,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:23,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2022-01-19 11:16:23,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:23,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:23,116 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:23,116 INFO L186 Difference]: Start difference. First operand has 205 places, 162 transitions, 925 flow. Second operand 7 states and 802 transitions. [2022-01-19 11:16:23,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 198 transitions, 1407 flow [2022-01-19 11:16:23,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 198 transitions, 1136 flow, removed 97 selfloop flow, removed 25 redundant places. [2022-01-19 11:16:23,301 INFO L242 Difference]: Finished difference. Result has 187 places, 163 transitions, 741 flow [2022-01-19 11:16:23,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=741, PETRI_PLACES=187, PETRI_TRANSITIONS=163} [2022-01-19 11:16:23,302 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2022-01-19 11:16:23,302 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 163 transitions, 741 flow [2022-01-19 11:16:23,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:23,302 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:23,302 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:23,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 11:16:23,303 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1203390452, now seen corresponding path program 2 times [2022-01-19 11:16:23,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:23,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108175248] [2022-01-19 11:16:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:23,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:16:23,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108175248] [2022-01-19 11:16:23,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108175248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:23,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:23,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:23,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531846488] [2022-01-19 11:16:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:23,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:23,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:23,378 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2022-01-19 11:16:23,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 163 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:23,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:23,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2022-01-19 11:16:23,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:24,582 INFO L129 PetriNetUnfolder]: 2745/12303 cut-off events. [2022-01-19 11:16:24,582 INFO L130 PetriNetUnfolder]: For 16835/17949 co-relation queries the response was YES. [2022-01-19 11:16:24,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32846 conditions, 12303 events. 2745/12303 cut-off events. For 16835/17949 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 183871 event pairs, 30 based on Foata normal form. 64/11461 useless extension candidates. Maximal degree in co-relation 32812. Up to 1925 conditions per place. [2022-01-19 11:16:24,686 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 27 selfloop transitions, 1 changer transitions 70/220 dead transitions. [2022-01-19 11:16:24,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 220 transitions, 1379 flow [2022-01-19 11:16:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:16:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:16:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2022-01-19 11:16:24,687 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8603411513859275 [2022-01-19 11:16:24,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2022-01-19 11:16:24,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2022-01-19 11:16:24,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:24,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2022-01-19 11:16:24,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:24,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:24,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:24,689 INFO L186 Difference]: Start difference. First operand has 187 places, 163 transitions, 741 flow. Second operand 7 states and 807 transitions. [2022-01-19 11:16:24,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 220 transitions, 1379 flow [2022-01-19 11:16:25,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 220 transitions, 1368 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 11:16:25,225 INFO L242 Difference]: Finished difference. Result has 191 places, 148 transitions, 626 flow [2022-01-19 11:16:25,225 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=191, PETRI_TRANSITIONS=148} [2022-01-19 11:16:25,225 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 50 predicate places. [2022-01-19 11:16:25,225 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 148 transitions, 626 flow [2022-01-19 11:16:25,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:25,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:25,225 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:25,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 11:16:25,226 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash -528436458, now seen corresponding path program 3 times [2022-01-19 11:16:25,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:25,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793290893] [2022-01-19 11:16:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:25,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:16:25,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:16:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:16:25,364 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:16:25,365 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:16:25,367 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:16:25,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:16:25,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 11:16:25,370 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:25,374 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:16:25,374 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:16:25,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:16:25 BasicIcfg [2022-01-19 11:16:25,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:16:25,480 INFO L158 Benchmark]: Toolchain (without parser) took 25911.17ms. Allocated memory was 402.7MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 346.2MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2022-01-19 11:16:25,480 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 402.7MB. Free memory is still 364.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:16:25,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.31ms. Allocated memory was 402.7MB in the beginning and 539.0MB in the end (delta: 136.3MB). Free memory was 346.0MB in the beginning and 497.5MB in the end (delta: -151.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.0GB. [2022-01-19 11:16:25,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.95ms. Allocated memory is still 539.0MB. Free memory was 497.5MB in the beginning and 494.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 11:16:25,481 INFO L158 Benchmark]: Boogie Preprocessor took 20.40ms. Allocated memory is still 539.0MB. Free memory was 494.3MB in the beginning and 492.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:16:25,481 INFO L158 Benchmark]: RCFGBuilder took 768.45ms. Allocated memory is still 539.0MB. Free memory was 492.2MB in the beginning and 409.4MB in the end (delta: 82.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.0GB. [2022-01-19 11:16:25,481 INFO L158 Benchmark]: TraceAbstraction took 24670.09ms. Allocated memory was 539.0MB in the beginning and 7.0GB in the end (delta: 6.5GB). Free memory was 408.4MB in the beginning and 5.9GB in the end (delta: -5.5GB). Peak memory consumption was 958.5MB. Max. memory is 16.0GB. [2022-01-19 11:16:25,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 402.7MB. Free memory is still 364.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 407.31ms. Allocated memory was 402.7MB in the beginning and 539.0MB in the end (delta: 136.3MB). Free memory was 346.0MB in the beginning and 497.5MB in the end (delta: -151.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.95ms. Allocated memory is still 539.0MB. Free memory was 497.5MB in the beginning and 494.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.40ms. Allocated memory is still 539.0MB. Free memory was 494.3MB in the beginning and 492.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 768.45ms. Allocated memory is still 539.0MB. Free memory was 492.2MB in the beginning and 409.4MB in the end (delta: 82.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.0GB. * TraceAbstraction took 24670.09ms. Allocated memory was 539.0MB in the beginning and 7.0GB in the end (delta: 6.5GB). Free memory was 408.4MB in the beginning and 5.9GB in the end (delta: -5.5GB). Peak memory consumption was 958.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((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(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; 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, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((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(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; 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, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; 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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((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(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=1, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=1, __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__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=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __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$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$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: 848]: 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: 844]: 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: 842]: 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: 846]: 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, 169 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: 24.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1356 mSDsluCounter, 1212 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2026 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3622 IncrementalHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 225 mSDtfsCounter, 3622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1406occurred in iteration=18, InterpolantAutomatonStates: 264, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2073 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1948 ConstructedInterpolants, 0 QuantifiedInterpolants, 11132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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! [2022-01-19 11:16:25,549 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...