./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:36:14,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:36:14,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:36:14,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:36:14,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:36:14,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:36:14,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:36:14,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:36:14,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:36:14,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:36:14,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:36:14,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:36:14,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:36:14,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:36:14,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:36:14,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:36:14,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:36:14,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:36:14,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:36:14,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:36:14,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:36:14,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:36:14,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:36:14,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:36:14,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:36:14,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:36:14,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:36:14,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:36:14,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:36:14,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:36:14,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:36:14,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:36:14,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:36:14,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:36:14,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:36:14,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:36:14,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:36:14,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:36:14,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:36:14,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:36:14,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:36:14,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:36:14,165 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:36:14,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:36:14,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:36:14,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:36:14,167 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:36:14,167 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:36:14,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:36:14,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:36:14,168 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:36:14,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:36:14,169 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:36:14,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:36:14,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:36:14,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:36:14,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:36:14,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:36:14,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:36:14,170 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:36:14,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:36:14,171 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:36:14,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:36:14,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:36:14,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:36:14,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:36:14,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:36:14,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:36:14,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:36:14,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:36:14,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:36:14,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:36:14,173 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:36:14,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:36:14,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:36:14,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:36:14,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2021-12-14 16:36:14,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:36:14,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:36:14,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:36:14,418 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:36:14,419 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:36:14,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:14,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8998bb380/9d0c57cea99e4cd98e84970f5f8f2cec/FLAG7dbaf36fb [2021-12-14 16:36:14,954 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:36:14,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:14,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8998bb380/9d0c57cea99e4cd98e84970f5f8f2cec/FLAG7dbaf36fb [2021-12-14 16:36:15,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8998bb380/9d0c57cea99e4cd98e84970f5f8f2cec [2021-12-14 16:36:15,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:36:15,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:36:15,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:36:15,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:36:15,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:36:15,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:36:15" (1/1) ... [2021-12-14 16:36:15,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3428a69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:15, skipping insertion in model container [2021-12-14 16:36:15,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:36:15" (1/1) ... [2021-12-14 16:36:15,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:36:15,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:36:15,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-14 16:36:15,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:36:15,889 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:36:15,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-14 16:36:15,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:36:16,002 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:36:16,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16 WrapperNode [2021-12-14 16:36:16,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:36:16,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:36:16,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:36:16,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:36:16,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,054 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-12-14 16:36:16,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:36:16,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:36:16,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:36:16,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:36:16,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:36:16,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:36:16,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:36:16,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:36:16,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (1/1) ... [2021-12-14 16:36:16,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:36:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:36:16,143 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) [2021-12-14 16:36:16,145 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 [2021-12-14 16:36:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:36:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:36:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:36:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:36:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:36:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-14 16:36:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-14 16:36:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-14 16:36:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-14 16:36:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-14 16:36:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-14 16:36:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:36:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:36:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:36:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:36:16,175 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:36:16,277 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:36:16,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:36:16,723 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:36:16,950 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:36:16,950 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 16:36:16,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:16 BoogieIcfgContainer [2021-12-14 16:36:16,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:36:16,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:36:16,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:36:16,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:36:16,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:36:15" (1/3) ... [2021-12-14 16:36:16,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59680cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:36:16, skipping insertion in model container [2021-12-14 16:36:16,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:16" (2/3) ... [2021-12-14 16:36:16,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59680cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:36:16, skipping insertion in model container [2021-12-14 16:36:16,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:16" (3/3) ... [2021-12-14 16:36:16,971 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:16,976 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:36:16,976 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:36:16,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:36:16,976 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:36:17,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,010 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,010 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,011 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,011 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,014 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,014 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,023 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,027 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,027 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,027 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,033 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,033 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,039 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,047 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,047 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,047 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,047 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,047 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,048 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:17,048 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-14 16:36:17,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:36:17,101 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=true, 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 [2021-12-14 16:36:17,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-14 16:36:17,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2021-12-14 16:36:17,153 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-12-14 16:36:17,153 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:36:17,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-12-14 16:36:17,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2021-12-14 16:36:17,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2021-12-14 16:36:17,173 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-12-14 16:36:17,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:36:17,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:17,174 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] [2021-12-14 16:36:17,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash -146856561, now seen corresponding path program 1 times [2021-12-14 16:36:17,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:17,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569254495] [2021-12-14 16:36:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:17,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:17,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:17,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569254495] [2021-12-14 16:36:17,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569254495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:17,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:17,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:36:17,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142421700] [2021-12-14 16:36:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:17,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:36:17,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:36:17,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:36:17,528 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2021-12-14 16:36:17,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:17,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2021-12-14 16:36:17,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:17,694 INFO L129 PetriNetUnfolder]: 17/242 cut-off events. [2021-12-14 16:36:17,694 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:36:17,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 748 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2021-12-14 16:36:17,699 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2021-12-14 16:36:17,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2021-12-14 16:36:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:36:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:36:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2021-12-14 16:36:17,715 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2021-12-14 16:36:17,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2021-12-14 16:36:17,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2021-12-14 16:36:17,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:17,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2021-12-14 16:36:17,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,743 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2021-12-14 16:36:17,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2021-12-14 16:36:17,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-14 16:36:17,752 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2021-12-14 16:36:17,754 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2021-12-14 16:36:17,759 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2021-12-14 16:36:17,759 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2021-12-14 16:36:17,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:17,760 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] [2021-12-14 16:36:17,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:36:17,761 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash -45666451, now seen corresponding path program 1 times [2021-12-14 16:36:17,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:17,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289467727] [2021-12-14 16:36:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:17,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:17,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:17,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289467727] [2021-12-14 16:36:17,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289467727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:17,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:17,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:36:17,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520449247] [2021-12-14 16:36:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:17,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:36:17,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:36:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:36:17,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2021-12-14 16:36:17,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:17,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:17,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2021-12-14 16:36:17,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:18,341 INFO L129 PetriNetUnfolder]: 357/1165 cut-off events. [2021-12-14 16:36:18,341 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-12-14 16:36:18,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1165 events. 357/1165 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7974 event pairs, 56 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2021-12-14 16:36:18,349 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2021-12-14 16:36:18,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2021-12-14 16:36:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:36:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:36:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2021-12-14 16:36:18,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2021-12-14 16:36:18,352 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2021-12-14 16:36:18,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2021-12-14 16:36:18,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:18,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2021-12-14 16:36:18,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:18,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:18,359 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:18,359 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2021-12-14 16:36:18,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2021-12-14 16:36:18,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:36:18,363 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2021-12-14 16:36:18,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2021-12-14 16:36:18,364 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2021-12-14 16:36:18,364 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2021-12-14 16:36:18,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:18,364 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:18,364 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] [2021-12-14 16:36:18,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:36:18,365 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -806024468, now seen corresponding path program 1 times [2021-12-14 16:36:18,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:18,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779858673] [2021-12-14 16:36:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:18,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:18,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779858673] [2021-12-14 16:36:18,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779858673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:18,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:18,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:36:18,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562803581] [2021-12-14 16:36:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:18,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:36:18,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:36:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:36:18,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2021-12-14 16:36:18,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:18,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:18,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2021-12-14 16:36:18,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:19,004 INFO L129 PetriNetUnfolder]: 257/660 cut-off events. [2021-12-14 16:36:19,004 INFO L130 PetriNetUnfolder]: For 581/585 co-relation queries the response was YES. [2021-12-14 16:36:19,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 660 events. 257/660 cut-off events. For 581/585 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3539 event pairs, 102 based on Foata normal form. 21/645 useless extension candidates. Maximal degree in co-relation 1462. Up to 219 conditions per place. [2021-12-14 16:36:19,012 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 17 selfloop transitions, 9 changer transitions 35/138 dead transitions. [2021-12-14 16:36:19,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 473 flow [2021-12-14 16:36:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:36:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-14 16:36:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1488 transitions. [2021-12-14 16:36:19,016 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2021-12-14 16:36:19,017 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1488 transitions. [2021-12-14 16:36:19,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1488 transitions. [2021-12-14 16:36:19,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:19,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1488 transitions. [2021-12-14 16:36:19,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,044 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,044 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 16 states and 1488 transitions. [2021-12-14 16:36:19,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 473 flow [2021-12-14 16:36:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 452 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-14 16:36:19,055 INFO L242 Difference]: Finished difference. Result has 132 places, 100 transitions, 302 flow [2021-12-14 16:36:19,056 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=100} [2021-12-14 16:36:19,057 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2021-12-14 16:36:19,058 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 100 transitions, 302 flow [2021-12-14 16:36:19,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,058 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:19,059 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] [2021-12-14 16:36:19,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:36:19,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1225042893, now seen corresponding path program 1 times [2021-12-14 16:36:19,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:19,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853038882] [2021-12-14 16:36:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:19,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:19,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:19,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853038882] [2021-12-14 16:36:19,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853038882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:19,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:19,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:36:19,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328688240] [2021-12-14 16:36:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:19,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:36:19,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:36:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:36:19,302 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2021-12-14 16:36:19,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 100 transitions, 302 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:19,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2021-12-14 16:36:19,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:19,633 INFO L129 PetriNetUnfolder]: 174/538 cut-off events. [2021-12-14 16:36:19,633 INFO L130 PetriNetUnfolder]: For 1443/1444 co-relation queries the response was YES. [2021-12-14 16:36:19,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 538 events. 174/538 cut-off events. For 1443/1444 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2806 event pairs, 20 based on Foata normal form. 12/528 useless extension candidates. Maximal degree in co-relation 1588. Up to 161 conditions per place. [2021-12-14 16:36:19,639 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 24 selfloop transitions, 7 changer transitions 25/135 dead transitions. [2021-12-14 16:36:19,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 650 flow [2021-12-14 16:36:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:36:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:36:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1330 transitions. [2021-12-14 16:36:19,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8407079646017699 [2021-12-14 16:36:19,643 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1330 transitions. [2021-12-14 16:36:19,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1330 transitions. [2021-12-14 16:36:19,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:19,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1330 transitions. [2021-12-14 16:36:19,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.0) internal successors, (1330), 14 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,653 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,653 INFO L186 Difference]: Start difference. First operand has 132 places, 100 transitions, 302 flow. Second operand 14 states and 1330 transitions. [2021-12-14 16:36:19,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 650 flow [2021-12-14 16:36:19,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 620 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-12-14 16:36:19,662 INFO L242 Difference]: Finished difference. Result has 140 places, 102 transitions, 347 flow [2021-12-14 16:36:19,662 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=347, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2021-12-14 16:36:19,663 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2021-12-14 16:36:19,663 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 347 flow [2021-12-14 16:36:19,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,664 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:19,664 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] [2021-12-14 16:36:19,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:36:19,665 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1708736691, now seen corresponding path program 1 times [2021-12-14 16:36:19,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:19,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709440032] [2021-12-14 16:36:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:19,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:19,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709440032] [2021-12-14 16:36:19,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709440032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:19,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:19,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 16:36:19,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460441654] [2021-12-14 16:36:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:19,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 16:36:19,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 16:36:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:36:19,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2021-12-14 16:36:19,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 347 flow. Second operand has 12 states, 12 states have (on average 90.41666666666667) internal successors, (1085), 12 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:19,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:19,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2021-12-14 16:36:19,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:20,292 INFO L129 PetriNetUnfolder]: 130/420 cut-off events. [2021-12-14 16:36:20,292 INFO L130 PetriNetUnfolder]: For 1955/1960 co-relation queries the response was YES. [2021-12-14 16:36:20,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 420 events. 130/420 cut-off events. For 1955/1960 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1847 event pairs, 28 based on Foata normal form. 10/410 useless extension candidates. Maximal degree in co-relation 1477. Up to 153 conditions per place. [2021-12-14 16:36:20,298 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 11 changer transitions 13/122 dead transitions. [2021-12-14 16:36:20,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 122 transitions, 605 flow [2021-12-14 16:36:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:36:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:36:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1290 transitions. [2021-12-14 16:36:20,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8154235145385588 [2021-12-14 16:36:20,302 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1290 transitions. [2021-12-14 16:36:20,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1290 transitions. [2021-12-14 16:36:20,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:20,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1290 transitions. [2021-12-14 16:36:20,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.14285714285714) internal successors, (1290), 14 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,309 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,309 INFO L186 Difference]: Start difference. First operand has 140 places, 102 transitions, 347 flow. Second operand 14 states and 1290 transitions. [2021-12-14 16:36:20,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 122 transitions, 605 flow [2021-12-14 16:36:20,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 122 transitions, 543 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-12-14 16:36:20,316 INFO L242 Difference]: Finished difference. Result has 144 places, 105 transitions, 378 flow [2021-12-14 16:36:20,316 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=378, PETRI_PLACES=144, PETRI_TRANSITIONS=105} [2021-12-14 16:36:20,317 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2021-12-14 16:36:20,317 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 105 transitions, 378 flow [2021-12-14 16:36:20,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 90.41666666666667) internal successors, (1085), 12 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,317 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:20,317 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] [2021-12-14 16:36:20,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:36:20,318 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash -644253357, now seen corresponding path program 1 times [2021-12-14 16:36:20,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:20,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491002801] [2021-12-14 16:36:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:20,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:20,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:20,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491002801] [2021-12-14 16:36:20,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491002801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:20,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:20,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:36:20,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694779067] [2021-12-14 16:36:20,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:20,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:36:20,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:36:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:36:20,510 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2021-12-14 16:36:20,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 105 transitions, 378 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:20,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2021-12-14 16:36:20,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:20,808 INFO L129 PetriNetUnfolder]: 152/454 cut-off events. [2021-12-14 16:36:20,808 INFO L130 PetriNetUnfolder]: For 2162/2285 co-relation queries the response was YES. [2021-12-14 16:36:20,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 454 events. 152/454 cut-off events. For 2162/2285 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2189 event pairs, 18 based on Foata normal form. 12/443 useless extension candidates. Maximal degree in co-relation 1697. Up to 158 conditions per place. [2021-12-14 16:36:20,814 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 22 selfloop transitions, 11 changer transitions 19/129 dead transitions. [2021-12-14 16:36:20,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 129 transitions, 706 flow [2021-12-14 16:36:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:36:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-14 16:36:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1118 transitions. [2021-12-14 16:36:20,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8244837758112095 [2021-12-14 16:36:20,818 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1118 transitions. [2021-12-14 16:36:20,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1118 transitions. [2021-12-14 16:36:20,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:20,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1118 transitions. [2021-12-14 16:36:20,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.16666666666667) internal successors, (1118), 12 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,824 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,824 INFO L186 Difference]: Start difference. First operand has 144 places, 105 transitions, 378 flow. Second operand 12 states and 1118 transitions. [2021-12-14 16:36:20,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 129 transitions, 706 flow [2021-12-14 16:36:20,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 129 transitions, 644 flow, removed 24 selfloop flow, removed 14 redundant places. [2021-12-14 16:36:20,830 INFO L242 Difference]: Finished difference. Result has 142 places, 107 transitions, 415 flow [2021-12-14 16:36:20,830 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=415, PETRI_PLACES=142, PETRI_TRANSITIONS=107} [2021-12-14 16:36:20,831 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2021-12-14 16:36:20,831 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 107 transitions, 415 flow [2021-12-14 16:36:20,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:20,832 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:20,832 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] [2021-12-14 16:36:20,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:36:20,833 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 680326131, now seen corresponding path program 2 times [2021-12-14 16:36:20,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:20,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717940557] [2021-12-14 16:36:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:20,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:21,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:21,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717940557] [2021-12-14 16:36:21,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717940557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:21,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:21,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:36:21,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669900160] [2021-12-14 16:36:21,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:36:21,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:36:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:36:21,023 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2021-12-14 16:36:21,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 107 transitions, 415 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:21,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2021-12-14 16:36:21,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:21,362 INFO L129 PetriNetUnfolder]: 154/449 cut-off events. [2021-12-14 16:36:21,362 INFO L130 PetriNetUnfolder]: For 3576/3681 co-relation queries the response was YES. [2021-12-14 16:36:21,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 449 events. 154/449 cut-off events. For 3576/3681 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2098 event pairs, 23 based on Foata normal form. 12/438 useless extension candidates. Maximal degree in co-relation 2062. Up to 159 conditions per place. [2021-12-14 16:36:21,368 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 21 selfloop transitions, 14 changer transitions 19/131 dead transitions. [2021-12-14 16:36:21,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 131 transitions, 853 flow [2021-12-14 16:36:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1206 transitions. [2021-12-14 16:36:21,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8209666439754936 [2021-12-14 16:36:21,372 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1206 transitions. [2021-12-14 16:36:21,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1206 transitions. [2021-12-14 16:36:21,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:21,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1206 transitions. [2021-12-14 16:36:21,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.76923076923077) internal successors, (1206), 13 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) [2021-12-14 16:36:21,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,379 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,379 INFO L186 Difference]: Start difference. First operand has 142 places, 107 transitions, 415 flow. Second operand 13 states and 1206 transitions. [2021-12-14 16:36:21,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 131 transitions, 853 flow [2021-12-14 16:36:21,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 131 transitions, 804 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-12-14 16:36:21,387 INFO L242 Difference]: Finished difference. Result has 148 places, 109 transitions, 474 flow [2021-12-14 16:36:21,388 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=474, PETRI_PLACES=148, PETRI_TRANSITIONS=109} [2021-12-14 16:36:21,388 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2021-12-14 16:36:21,389 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 109 transitions, 474 flow [2021-12-14 16:36:21,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,389 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:21,389 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] [2021-12-14 16:36:21,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:36:21,390 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash 619893123, now seen corresponding path program 3 times [2021-12-14 16:36:21,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:21,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544281740] [2021-12-14 16:36:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:21,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:21,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544281740] [2021-12-14 16:36:21,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544281740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:21,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:21,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:36:21,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764835049] [2021-12-14 16:36:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:21,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:36:21,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:36:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:36:21,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2021-12-14 16:36:21,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 109 transitions, 474 flow. Second operand has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:21,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2021-12-14 16:36:21,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:21,779 INFO L129 PetriNetUnfolder]: 151/479 cut-off events. [2021-12-14 16:36:21,779 INFO L130 PetriNetUnfolder]: For 6944/6991 co-relation queries the response was YES. [2021-12-14 16:36:21,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 479 events. 151/479 cut-off events. For 6944/6991 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2288 event pairs, 20 based on Foata normal form. 20/475 useless extension candidates. Maximal degree in co-relation 2550. Up to 139 conditions per place. [2021-12-14 16:36:21,786 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 25 selfloop transitions, 13 changer transitions 19/136 dead transitions. [2021-12-14 16:36:21,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 136 transitions, 1080 flow [2021-12-14 16:36:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:36:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:36:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1048 transitions. [2021-12-14 16:36:21,789 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8431214802896219 [2021-12-14 16:36:21,790 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1048 transitions. [2021-12-14 16:36:21,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1048 transitions. [2021-12-14 16:36:21,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:21,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1048 transitions. [2021-12-14 16:36:21,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.27272727272727) internal successors, (1048), 11 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,795 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,795 INFO L186 Difference]: Start difference. First operand has 148 places, 109 transitions, 474 flow. Second operand 11 states and 1048 transitions. [2021-12-14 16:36:21,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 136 transitions, 1080 flow [2021-12-14 16:36:21,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 136 transitions, 722 flow, removed 168 selfloop flow, removed 17 redundant places. [2021-12-14 16:36:21,805 INFO L242 Difference]: Finished difference. Result has 142 places, 111 transitions, 461 flow [2021-12-14 16:36:21,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=461, PETRI_PLACES=142, PETRI_TRANSITIONS=111} [2021-12-14 16:36:21,806 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2021-12-14 16:36:21,806 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 111 transitions, 461 flow [2021-12-14 16:36:21,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:21,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:21,807 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] [2021-12-14 16:36:21,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:36:21,807 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1661838733, now seen corresponding path program 1 times [2021-12-14 16:36:21,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:21,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567322013] [2021-12-14 16:36:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:21,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:22,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567322013] [2021-12-14 16:36:22,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567322013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:22,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:22,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 16:36:22,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299402467] [2021-12-14 16:36:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:22,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 16:36:22,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 16:36:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-14 16:36:22,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2021-12-14 16:36:22,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 111 transitions, 461 flow. Second operand has 14 states, 14 states have (on average 88.42857142857143) internal successors, (1238), 14 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:22,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2021-12-14 16:36:22,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:22,424 INFO L129 PetriNetUnfolder]: 120/416 cut-off events. [2021-12-14 16:36:22,425 INFO L130 PetriNetUnfolder]: For 2461/2574 co-relation queries the response was YES. [2021-12-14 16:36:22,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 416 events. 120/416 cut-off events. For 2461/2574 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1989 event pairs, 12 based on Foata normal form. 7/397 useless extension candidates. Maximal degree in co-relation 1697. Up to 153 conditions per place. [2021-12-14 16:36:22,430 INFO L132 encePairwiseOnDemand]: 99/113 looper letters, 24 selfloop transitions, 18 changer transitions 10/127 dead transitions. [2021-12-14 16:36:22,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 127 transitions, 726 flow [2021-12-14 16:36:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:36:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-14 16:36:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1436 transitions. [2021-12-14 16:36:22,435 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7942477876106194 [2021-12-14 16:36:22,435 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1436 transitions. [2021-12-14 16:36:22,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1436 transitions. [2021-12-14 16:36:22,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:22,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1436 transitions. [2021-12-14 16:36:22,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 89.75) internal successors, (1436), 16 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,442 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,442 INFO L186 Difference]: Start difference. First operand has 142 places, 111 transitions, 461 flow. Second operand 16 states and 1436 transitions. [2021-12-14 16:36:22,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 127 transitions, 726 flow [2021-12-14 16:36:22,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 127 transitions, 623 flow, removed 44 selfloop flow, removed 9 redundant places. [2021-12-14 16:36:22,449 INFO L242 Difference]: Finished difference. Result has 150 places, 114 transitions, 505 flow [2021-12-14 16:36:22,449 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=505, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2021-12-14 16:36:22,450 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 32 predicate places. [2021-12-14 16:36:22,450 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 505 flow [2021-12-14 16:36:22,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 88.42857142857143) internal successors, (1238), 14 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,451 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:22,451 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] [2021-12-14 16:36:22,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:36:22,451 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1636586413, now seen corresponding path program 2 times [2021-12-14 16:36:22,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:22,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494807396] [2021-12-14 16:36:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:22,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:22,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:22,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494807396] [2021-12-14 16:36:22,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494807396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:22,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:22,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:36:22,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589084746] [2021-12-14 16:36:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:22,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:36:22,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:22,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:36:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:36:22,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2021-12-14 16:36:22,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 505 flow. Second operand has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:22,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:22,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2021-12-14 16:36:22,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:22,985 INFO L129 PetriNetUnfolder]: 122/434 cut-off events. [2021-12-14 16:36:22,985 INFO L130 PetriNetUnfolder]: For 2180/2429 co-relation queries the response was YES. [2021-12-14 16:36:22,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 434 events. 122/434 cut-off events. For 2180/2429 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2152 event pairs, 14 based on Foata normal form. 11/417 useless extension candidates. Maximal degree in co-relation 1703. Up to 164 conditions per place. [2021-12-14 16:36:22,990 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 29 selfloop transitions, 13 changer transitions 10/128 dead transitions. [2021-12-14 16:36:22,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 128 transitions, 763 flow [2021-12-14 16:36:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions. [2021-12-14 16:36:22,994 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.807351940095303 [2021-12-14 16:36:22,994 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions. [2021-12-14 16:36:22,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions. [2021-12-14 16:36:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:22,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions. [2021-12-14 16:36:22,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.23076923076923) internal successors, (1186), 13 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,000 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,001 INFO L186 Difference]: Start difference. First operand has 150 places, 114 transitions, 505 flow. Second operand 13 states and 1186 transitions. [2021-12-14 16:36:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 128 transitions, 763 flow [2021-12-14 16:36:23,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 128 transitions, 679 flow, removed 33 selfloop flow, removed 12 redundant places. [2021-12-14 16:36:23,008 INFO L242 Difference]: Finished difference. Result has 151 places, 115 transitions, 526 flow [2021-12-14 16:36:23,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=526, PETRI_PLACES=151, PETRI_TRANSITIONS=115} [2021-12-14 16:36:23,010 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2021-12-14 16:36:23,010 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 115 transitions, 526 flow [2021-12-14 16:36:23,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,011 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:23,011 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] [2021-12-14 16:36:23,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:36:23,012 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1589868921, now seen corresponding path program 3 times [2021-12-14 16:36:23,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:23,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507500762] [2021-12-14 16:36:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:23,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:23,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507500762] [2021-12-14 16:36:23,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507500762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:23,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:23,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 16:36:23,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832618155] [2021-12-14 16:36:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:23,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 16:36:23,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 16:36:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-14 16:36:23,320 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2021-12-14 16:36:23,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 115 transitions, 526 flow. Second operand has 14 states, 14 states have (on average 87.5) internal successors, (1225), 14 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:23,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2021-12-14 16:36:23,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:23,675 INFO L129 PetriNetUnfolder]: 122/453 cut-off events. [2021-12-14 16:36:23,675 INFO L130 PetriNetUnfolder]: For 2526/2589 co-relation queries the response was YES. [2021-12-14 16:36:23,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 453 events. 122/453 cut-off events. For 2526/2589 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2232 event pairs, 23 based on Foata normal form. 24/450 useless extension candidates. Maximal degree in co-relation 1775. Up to 161 conditions per place. [2021-12-14 16:36:23,681 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 28 selfloop transitions, 17 changer transitions 10/129 dead transitions. [2021-12-14 16:36:23,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 129 transitions, 800 flow [2021-12-14 16:36:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:36:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-14 16:36:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1333 transitions. [2021-12-14 16:36:23,683 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7864306784660767 [2021-12-14 16:36:23,683 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1333 transitions. [2021-12-14 16:36:23,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1333 transitions. [2021-12-14 16:36:23,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:23,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1333 transitions. [2021-12-14 16:36:23,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.86666666666666) internal successors, (1333), 15 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,689 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,689 INFO L186 Difference]: Start difference. First operand has 151 places, 115 transitions, 526 flow. Second operand 15 states and 1333 transitions. [2021-12-14 16:36:23,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 129 transitions, 800 flow [2021-12-14 16:36:23,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 129 transitions, 711 flow, removed 33 selfloop flow, removed 11 redundant places. [2021-12-14 16:36:23,696 INFO L242 Difference]: Finished difference. Result has 155 places, 116 transitions, 555 flow [2021-12-14 16:36:23,697 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=555, PETRI_PLACES=155, PETRI_TRANSITIONS=116} [2021-12-14 16:36:23,697 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2021-12-14 16:36:23,697 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 116 transitions, 555 flow [2021-12-14 16:36:23,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.5) internal successors, (1225), 14 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,698 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:23,698 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] [2021-12-14 16:36:23,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:36:23,698 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash -125168855, now seen corresponding path program 1 times [2021-12-14 16:36:23,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:23,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712326763] [2021-12-14 16:36:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:23,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:23,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:23,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712326763] [2021-12-14 16:36:23,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712326763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:23,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:23,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:36:23,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975341528] [2021-12-14 16:36:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:23,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:36:23,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:36:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:36:23,781 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2021-12-14 16:36:23,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 116 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:23,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:23,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2021-12-14 16:36:23,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:24,234 INFO L129 PetriNetUnfolder]: 1050/2158 cut-off events. [2021-12-14 16:36:24,235 INFO L130 PetriNetUnfolder]: For 13881/14163 co-relation queries the response was YES. [2021-12-14 16:36:24,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 2158 events. 1050/2158 cut-off events. For 13881/14163 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14526 event pairs, 36 based on Foata normal form. 123/2203 useless extension candidates. Maximal degree in co-relation 8009. Up to 648 conditions per place. [2021-12-14 16:36:24,257 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 119 selfloop transitions, 15 changer transitions 26/239 dead transitions. [2021-12-14 16:36:24,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 239 transitions, 2056 flow [2021-12-14 16:36:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:36:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:36:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2021-12-14 16:36:24,260 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2021-12-14 16:36:24,260 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2021-12-14 16:36:24,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2021-12-14 16:36:24,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:24,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2021-12-14 16:36:24,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,265 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,265 INFO L186 Difference]: Start difference. First operand has 155 places, 116 transitions, 555 flow. Second operand 10 states and 974 transitions. [2021-12-14 16:36:24,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 239 transitions, 2056 flow [2021-12-14 16:36:24,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 239 transitions, 1879 flow, removed 43 selfloop flow, removed 13 redundant places. [2021-12-14 16:36:24,284 INFO L242 Difference]: Finished difference. Result has 151 places, 129 transitions, 606 flow [2021-12-14 16:36:24,285 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=606, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2021-12-14 16:36:24,286 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2021-12-14 16:36:24,286 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 606 flow [2021-12-14 16:36:24,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:24,287 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] [2021-12-14 16:36:24,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:36:24,288 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1864530944, now seen corresponding path program 1 times [2021-12-14 16:36:24,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256968528] [2021-12-14 16:36:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:24,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:24,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:24,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256968528] [2021-12-14 16:36:24,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256968528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:24,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:24,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 16:36:24,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814617966] [2021-12-14 16:36:24,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:24,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 16:36:24,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 16:36:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:36:24,496 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2021-12-14 16:36:24,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 606 flow. Second operand has 12 states, 12 states have (on average 88.66666666666667) internal successors, (1064), 12 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:24,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2021-12-14 16:36:24,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:24,912 INFO L129 PetriNetUnfolder]: 232/1069 cut-off events. [2021-12-14 16:36:24,912 INFO L130 PetriNetUnfolder]: For 2396/2592 co-relation queries the response was YES. [2021-12-14 16:36:24,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1069 events. 232/1069 cut-off events. For 2396/2592 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8639 event pairs, 47 based on Foata normal form. 37/1027 useless extension candidates. Maximal degree in co-relation 3218. Up to 192 conditions per place. [2021-12-14 16:36:24,925 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 37 selfloop transitions, 20 changer transitions 0/145 dead transitions. [2021-12-14 16:36:24,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 145 transitions, 844 flow [2021-12-14 16:36:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1174 transitions. [2021-12-14 16:36:24,928 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7991831177671885 [2021-12-14 16:36:24,928 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1174 transitions. [2021-12-14 16:36:24,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1174 transitions. [2021-12-14 16:36:24,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:24,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1174 transitions. [2021-12-14 16:36:24,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.3076923076923) internal successors, (1174), 13 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,933 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,933 INFO L186 Difference]: Start difference. First operand has 151 places, 129 transitions, 606 flow. Second operand 13 states and 1174 transitions. [2021-12-14 16:36:24,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 145 transitions, 844 flow [2021-12-14 16:36:24,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 145 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:36:24,943 INFO L242 Difference]: Finished difference. Result has 169 places, 137 transitions, 766 flow [2021-12-14 16:36:24,943 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=766, PETRI_PLACES=169, PETRI_TRANSITIONS=137} [2021-12-14 16:36:24,945 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 51 predicate places. [2021-12-14 16:36:24,945 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 137 transitions, 766 flow [2021-12-14 16:36:24,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.66666666666667) internal successors, (1064), 12 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:24,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:24,946 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] [2021-12-14 16:36:24,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:36:24,947 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -800334856, now seen corresponding path program 1 times [2021-12-14 16:36:24,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578421211] [2021-12-14 16:36:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:24,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:25,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:25,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578421211] [2021-12-14 16:36:25,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578421211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:25,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:25,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:36:25,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137447619] [2021-12-14 16:36:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:25,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:36:25,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:36:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:36:25,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2021-12-14 16:36:25,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 137 transitions, 766 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:25,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2021-12-14 16:36:25,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:25,647 INFO L129 PetriNetUnfolder]: 1013/2420 cut-off events. [2021-12-14 16:36:25,647 INFO L130 PetriNetUnfolder]: For 12385/12613 co-relation queries the response was YES. [2021-12-14 16:36:25,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 2420 events. 1013/2420 cut-off events. For 12385/12613 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18848 event pairs, 27 based on Foata normal form. 157/2540 useless extension candidates. Maximal degree in co-relation 9658. Up to 513 conditions per place. [2021-12-14 16:36:25,671 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 105 selfloop transitions, 28 changer transitions 52/264 dead transitions. [2021-12-14 16:36:25,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 264 transitions, 2419 flow [2021-12-14 16:36:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions. [2021-12-14 16:36:25,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8618107556160653 [2021-12-14 16:36:25,674 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions. [2021-12-14 16:36:25,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions. [2021-12-14 16:36:25,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:25,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions. [2021-12-14 16:36:25,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,679 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,679 INFO L186 Difference]: Start difference. First operand has 169 places, 137 transitions, 766 flow. Second operand 13 states and 1266 transitions. [2021-12-14 16:36:25,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 264 transitions, 2419 flow [2021-12-14 16:36:25,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 264 transitions, 2137 flow, removed 68 selfloop flow, removed 11 redundant places. [2021-12-14 16:36:25,703 INFO L242 Difference]: Finished difference. Result has 176 places, 140 transitions, 764 flow [2021-12-14 16:36:25,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=764, PETRI_PLACES=176, PETRI_TRANSITIONS=140} [2021-12-14 16:36:25,704 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2021-12-14 16:36:25,704 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 140 transitions, 764 flow [2021-12-14 16:36:25,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,705 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:25,705 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] [2021-12-14 16:36:25,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 16:36:25,706 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1242932333, now seen corresponding path program 1 times [2021-12-14 16:36:25,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641039949] [2021-12-14 16:36:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:25,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:25,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:25,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641039949] [2021-12-14 16:36:25,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641039949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:25,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:25,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:36:25,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122377927] [2021-12-14 16:36:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:25,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:36:25,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:36:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:36:25,795 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2021-12-14 16:36:25,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 140 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:25,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:25,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2021-12-14 16:36:25,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:26,210 INFO L129 PetriNetUnfolder]: 349/1771 cut-off events. [2021-12-14 16:36:26,210 INFO L130 PetriNetUnfolder]: For 6040/6542 co-relation queries the response was YES. [2021-12-14 16:36:26,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 1771 events. 349/1771 cut-off events. For 6040/6542 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17570 event pairs, 14 based on Foata normal form. 39/1735 useless extension candidates. Maximal degree in co-relation 5998. Up to 392 conditions per place. [2021-12-14 16:36:26,232 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 47 selfloop transitions, 3 changer transitions 21/181 dead transitions. [2021-12-14 16:36:26,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 181 transitions, 1296 flow [2021-12-14 16:36:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:36:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:36:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2021-12-14 16:36:26,236 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2021-12-14 16:36:26,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2021-12-14 16:36:26,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2021-12-14 16:36:26,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:26,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2021-12-14 16:36:26,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:26,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:26,243 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:26,243 INFO L186 Difference]: Start difference. First operand has 176 places, 140 transitions, 764 flow. Second operand 9 states and 873 transitions. [2021-12-14 16:36:26,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 181 transitions, 1296 flow [2021-12-14 16:36:26,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 181 transitions, 1177 flow, removed 49 selfloop flow, removed 11 redundant places. [2021-12-14 16:36:26,285 INFO L242 Difference]: Finished difference. Result has 174 places, 140 transitions, 706 flow [2021-12-14 16:36:26,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=174, PETRI_TRANSITIONS=140} [2021-12-14 16:36:26,286 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 56 predicate places. [2021-12-14 16:36:26,286 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 140 transitions, 706 flow [2021-12-14 16:36:26,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:26,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:26,287 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] [2021-12-14 16:36:26,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 16:36:26,287 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1290906910, now seen corresponding path program 1 times [2021-12-14 16:36:26,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:26,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887186584] [2021-12-14 16:36:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:26,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:26,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:26,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887186584] [2021-12-14 16:36:26,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887186584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:26,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:26,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:36:26,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009667550] [2021-12-14 16:36:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:26,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:36:26,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:36:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:36:26,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2021-12-14 16:36:26,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 140 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:26,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:26,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2021-12-14 16:36:26,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:27,114 INFO L129 PetriNetUnfolder]: 1261/3109 cut-off events. [2021-12-14 16:36:27,114 INFO L130 PetriNetUnfolder]: For 12450/12700 co-relation queries the response was YES. [2021-12-14 16:36:27,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 3109 events. 1261/3109 cut-off events. For 12450/12700 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 27661 event pairs, 20 based on Foata normal form. 215/3277 useless extension candidates. Maximal degree in co-relation 12365. Up to 616 conditions per place. [2021-12-14 16:36:27,136 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 41 selfloop transitions, 12 changer transitions 121/250 dead transitions. [2021-12-14 16:36:27,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 250 transitions, 2033 flow [2021-12-14 16:36:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:36:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-14 16:36:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1527 transitions. [2021-12-14 16:36:27,139 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8445796460176991 [2021-12-14 16:36:27,139 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1527 transitions. [2021-12-14 16:36:27,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1527 transitions. [2021-12-14 16:36:27,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:27,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1527 transitions. [2021-12-14 16:36:27,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.4375) internal successors, (1527), 16 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,147 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,148 INFO L186 Difference]: Start difference. First operand has 174 places, 140 transitions, 706 flow. Second operand 16 states and 1527 transitions. [2021-12-14 16:36:27,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 250 transitions, 2033 flow [2021-12-14 16:36:27,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 250 transitions, 1824 flow, removed 69 selfloop flow, removed 14 redundant places. [2021-12-14 16:36:27,194 INFO L242 Difference]: Finished difference. Result has 174 places, 109 transitions, 462 flow [2021-12-14 16:36:27,194 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=462, PETRI_PLACES=174, PETRI_TRANSITIONS=109} [2021-12-14 16:36:27,195 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 56 predicate places. [2021-12-14 16:36:27,195 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 109 transitions, 462 flow [2021-12-14 16:36:27,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,197 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:27,197 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] [2021-12-14 16:36:27,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 16:36:27,197 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 255438812, now seen corresponding path program 1 times [2021-12-14 16:36:27,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:27,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611624521] [2021-12-14 16:36:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:27,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:36:27,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611624521] [2021-12-14 16:36:27,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611624521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:27,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:27,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:36:27,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905291846] [2021-12-14 16:36:27,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:27,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:36:27,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:36:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:36:27,302 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2021-12-14 16:36:27,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 109 transitions, 462 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:27,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2021-12-14 16:36:27,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:27,479 INFO L129 PetriNetUnfolder]: 26/227 cut-off events. [2021-12-14 16:36:27,479 INFO L130 PetriNetUnfolder]: For 411/420 co-relation queries the response was YES. [2021-12-14 16:36:27,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 227 events. 26/227 cut-off events. For 411/420 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 684 event pairs, 1 based on Foata normal form. 4/228 useless extension candidates. Maximal degree in co-relation 555. Up to 26 conditions per place. [2021-12-14 16:36:27,481 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 18 selfloop transitions, 1 changer transitions 22/123 dead transitions. [2021-12-14 16:36:27,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 123 transitions, 620 flow [2021-12-14 16:36:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:36:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-14 16:36:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2021-12-14 16:36:27,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8419721871049305 [2021-12-14 16:36:27,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2021-12-14 16:36:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2021-12-14 16:36:27,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:27,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2021-12-14 16:36:27,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,486 INFO L186 Difference]: Start difference. First operand has 174 places, 109 transitions, 462 flow. Second operand 7 states and 666 transitions. [2021-12-14 16:36:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 123 transitions, 620 flow [2021-12-14 16:36:27,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 464 flow, removed 42 selfloop flow, removed 34 redundant places. [2021-12-14 16:36:27,491 INFO L242 Difference]: Finished difference. Result has 131 places, 101 transitions, 274 flow [2021-12-14 16:36:27,491 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=131, PETRI_TRANSITIONS=101} [2021-12-14 16:36:27,491 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2021-12-14 16:36:27,491 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 274 flow [2021-12-14 16:36:27,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:36:27,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:27,492 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] [2021-12-14 16:36:27,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 16:36:27,492 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:36:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1009060032, now seen corresponding path program 2 times [2021-12-14 16:36:27,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:27,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099828095] [2021-12-14 16:36:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:27,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:36:27,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:36:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:36:27,600 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:36:27,601 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:36:27,601 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-14 16:36:27,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-14 16:36:27,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-14 16:36:27,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-14 16:36:27,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-14 16:36:27,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-14 16:36:27,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 16:36:27,608 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:36:27,612 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:36:27,612 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:36:27,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:36:27 BasicIcfg [2021-12-14 16:36:27,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:36:27,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:36:27,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:36:27,750 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:36:27,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:16" (3/4) ... [2021-12-14 16:36:27,752 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:36:27,867 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:36:27,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:36:27,868 INFO L158 Benchmark]: Toolchain (without parser) took 12368.28ms. Allocated memory was 98.6MB in the beginning and 486.5MB in the end (delta: 388.0MB). Free memory was 58.0MB in the beginning and 289.2MB in the end (delta: -231.2MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,870 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:36:27,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.52ms. Allocated memory is still 98.6MB. Free memory was 57.8MB in the beginning and 61.8MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.32ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 58.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,871 INFO L158 Benchmark]: Boogie Preprocessor took 51.68ms. Allocated memory is still 98.6MB. Free memory was 58.9MB in the beginning and 56.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,871 INFO L158 Benchmark]: RCFGBuilder took 841.97ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 56.6MB in the beginning and 52.1MB in the end (delta: 4.5MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,871 INFO L158 Benchmark]: TraceAbstraction took 10795.68ms. Allocated memory was 121.6MB in the beginning and 486.5MB in the end (delta: 364.9MB). Free memory was 52.1MB in the beginning and 315.4MB in the end (delta: -263.3MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,872 INFO L158 Benchmark]: Witness Printer took 117.15ms. Allocated memory is still 486.5MB. Free memory was 315.4MB in the beginning and 289.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-14 16:36:27,874 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.52ms. Allocated memory is still 98.6MB. Free memory was 57.8MB in the beginning and 61.8MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.32ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 58.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.68ms. Allocated memory is still 98.6MB. Free memory was 58.9MB in the beginning and 56.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 841.97ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 56.6MB in the beginning and 52.1MB in the end (delta: 4.5MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10795.68ms. Allocated memory was 121.6MB in the beginning and 486.5MB in the end (delta: 364.9MB). Free memory was 52.1MB in the beginning and 315.4MB in the end (delta: -263.3MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * Witness Printer took 117.15ms. Allocated memory is still 486.5MB. Free memory was 315.4MB in the beginning and 289.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 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) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] 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) [L762] 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) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 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 [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 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 [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=53, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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=3, __unbuffered_p2_EAX=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=53, weak$$choice2=255, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 784 mSDsluCounter, 778 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1133 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1957 IncrementalHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 143 mSDtfsCounter, 1957 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=13, InterpolantAutomatonStates: 204, 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.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1408 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1304 ConstructedInterpolants, 0 QuantifiedInterpolants, 7704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-12-14 16:36:27,925 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE