/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:45:45,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:45:45,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:45:45,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:45:45,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:45:45,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:45:45,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:45:45,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:45:45,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:45:45,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:45:45,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:45:45,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:45:45,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:45:45,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:45:45,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:45:45,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:45:45,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:45:45,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:45:45,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:45:45,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:45:45,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:45:45,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:45:45,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:45:45,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:45:45,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:45:45,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:45:45,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:45:45,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:45:45,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:45:45,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:45:45,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:45:45,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:45:45,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:45:45,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:45:45,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:45:45,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:45:45,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:45:45,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:45:45,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:45:45,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:45:45,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:45:45,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:45:45,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:45:45,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:45:45,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:45:45,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:45:45,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:45:45,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:45:45,300 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:45:45,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:45:45,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:45:45,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:45:45,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:45:45,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:45:45,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:45:45,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:45:45,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:45:45,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:45:45,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:45:45,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:45:45,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 22:45:45,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:45:45,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:45:45,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:45:45,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:45:45,527 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:45:45,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 22:45:45,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ab62abc/a0e065e8aa944490986a9186a1f8a1d0/FLAGc94eaf6e1 [2022-01-18 22:45:46,094 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:45:46,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 22:45:46,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ab62abc/a0e065e8aa944490986a9186a1f8a1d0/FLAGc94eaf6e1 [2022-01-18 22:45:46,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ab62abc/a0e065e8aa944490986a9186a1f8a1d0 [2022-01-18 22:45:46,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:45:46,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:45:46,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:45:46,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:45:46,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:45:46,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:45:46" (1/1) ... [2022-01-18 22:45:46,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d19778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:46, skipping insertion in model container [2022-01-18 22:45:46,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:45:46" (1/1) ... [2022-01-18 22:45:46,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:45:46,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:45:46,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-18 22:45:47,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:45:47,100 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:45:47,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-01-18 22:45:47,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:45:47,213 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:45:47,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47 WrapperNode [2022-01-18 22:45:47,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:45:47,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:45:47,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:45:47,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:45:47,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,272 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 297 [2022-01-18 22:45:47,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:45:47,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:45:47,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:45:47,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:45:47,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:45:47,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:45:47,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:45:47,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:45:47,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (1/1) ... [2022-01-18 22:45:47,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:45:47,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:45:47,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 22:45:47,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 22:45:47,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:45:47,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:45:47,396 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:45:47,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:45:47,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:45:47,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:45:47,397 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-18 22:45:47,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-18 22:45:47,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:45:47,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:45:47,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:45:47,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:45:47,399 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:45:47,501 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:45:47,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:45:47,940 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:45:48,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:45:48,232 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:45:48,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:45:48 BoogieIcfgContainer [2022-01-18 22:45:48,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:45:48,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:45:48,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:45:48,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:45:48,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:45:46" (1/3) ... [2022-01-18 22:45:48,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4902cae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:45:48, skipping insertion in model container [2022-01-18 22:45:48,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:45:47" (2/3) ... [2022-01-18 22:45:48,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4902cae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:45:48, skipping insertion in model container [2022-01-18 22:45:48,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:45:48" (3/3) ... [2022-01-18 22:45:48,242 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 22:45:48,248 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:45:48,249 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:45:48,249 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:45:48,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,300 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,300 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,301 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,301 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,301 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,301 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,301 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,302 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,302 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,302 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,303 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,303 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,304 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,304 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,305 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,306 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,306 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,306 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,306 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,306 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,310 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,310 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,310 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,310 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,310 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,311 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,314 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,314 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,314 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,315 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,316 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,316 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,316 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,316 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,319 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,320 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,320 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,320 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,321 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,321 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,325 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,330 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,330 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,330 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,331 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,331 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,331 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,332 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,333 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,334 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,334 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,334 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,334 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:45:48,335 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:45:48,375 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:45:48,381 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:45:48,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 22:45:48,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-01-18 22:45:48,434 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2022-01-18 22:45:48,434 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:45:48,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-01-18 22:45:48,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-01-18 22:45:48,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-01-18 22:45:48,456 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2022-01-18 22:45:48,456 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:45:48,456 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:48,457 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] [2022-01-18 22:45:48,457 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2132212955, now seen corresponding path program 1 times [2022-01-18 22:45:48,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:48,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488501594] [2022-01-18 22:45:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:48,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:48,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:48,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488501594] [2022-01-18 22:45:48,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488501594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:48,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:48,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:45:48,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19863403] [2022-01-18 22:45:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:48,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:45:48,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:45:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:45:48,784 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 136 [2022-01-18 22:45:48,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:48,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:48,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 136 [2022-01-18 22:45:48,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:48,910 INFO L129 PetriNetUnfolder]: 17/214 cut-off events. [2022-01-18 22:45:48,910 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-18 22:45:48,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 214 events. 17/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 511 event pairs, 3 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 213. Up to 27 conditions per place. [2022-01-18 22:45:48,916 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 11 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-01-18 22:45:48,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 131 transitions, 300 flow [2022-01-18 22:45:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:45:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:45:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-01-18 22:45:48,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-01-18 22:45:48,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-01-18 22:45:48,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-01-18 22:45:48,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:48,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-01-18 22:45:48,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:48,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:48,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:48,943 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-01-18 22:45:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 131 transitions, 300 flow [2022-01-18 22:45:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-18 22:45:48,950 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-01-18 22:45:48,951 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-01-18 22:45:48,954 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-01-18 22:45:48,954 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-01-18 22:45:48,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:48,955 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:48,955 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] [2022-01-18 22:45:48,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:45:48,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1153384263, now seen corresponding path program 1 times [2022-01-18 22:45:48,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:48,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52572258] [2022-01-18 22:45:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:48,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:49,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:49,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52572258] [2022-01-18 22:45:49,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52572258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:49,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:49,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:45:49,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643497182] [2022-01-18 22:45:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:49,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:45:49,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:49,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:45:49,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:45:49,227 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 136 [2022-01-18 22:45:49,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:49,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 136 [2022-01-18 22:45:49,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:49,541 INFO L129 PetriNetUnfolder]: 84/443 cut-off events. [2022-01-18 22:45:49,541 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-18 22:45:49,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 443 events. 84/443 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2080 event pairs, 20 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 585. Up to 65 conditions per place. [2022-01-18 22:45:49,547 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 16 selfloop transitions, 2 changer transitions 38/154 dead transitions. [2022-01-18 22:45:49,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 154 transitions, 412 flow [2022-01-18 22:45:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:45:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:45:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2022-01-18 22:45:49,553 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-01-18 22:45:49,553 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2022-01-18 22:45:49,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2022-01-18 22:45:49,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:49,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2022-01-18 22:45:49,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,564 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,564 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1080 transitions. [2022-01-18 22:45:49,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 154 transitions, 412 flow [2022-01-18 22:45:49,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 154 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:45:49,569 INFO L242 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-01-18 22:45:49,569 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-01-18 22:45:49,570 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-01-18 22:45:49,570 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-01-18 22:45:49,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,571 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:49,571 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:49,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:45:49,571 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -38168854, now seen corresponding path program 1 times [2022-01-18 22:45:49,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:49,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918855963] [2022-01-18 22:45:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:49,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:49,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:49,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918855963] [2022-01-18 22:45:49,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918855963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:49,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:49,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:45:49,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144426889] [2022-01-18 22:45:49,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:49,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:45:49,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:45:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:45:49,824 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-01-18 22:45:49,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:49,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:49,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-01-18 22:45:49,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:50,073 INFO L129 PetriNetUnfolder]: 202/575 cut-off events. [2022-01-18 22:45:50,073 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-01-18 22:45:50,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 575 events. 202/575 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2894 event pairs, 34 based on Foata normal form. 12/568 useless extension candidates. Maximal degree in co-relation 1014. Up to 218 conditions per place. [2022-01-18 22:45:50,080 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 21 selfloop transitions, 3 changer transitions 28/149 dead transitions. [2022-01-18 22:45:50,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 452 flow [2022-01-18 22:45:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:45:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:45:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2022-01-18 22:45:50,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-01-18 22:45:50,083 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2022-01-18 22:45:50,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2022-01-18 22:45:50,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:50,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2022-01-18 22:45:50,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,090 INFO L186 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 9 states and 1080 transitions. [2022-01-18 22:45:50,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 452 flow [2022-01-18 22:45:50,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 149 transitions, 420 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:45:50,095 INFO L242 Difference]: Finished difference. Result has 139 places, 116 transitions, 283 flow [2022-01-18 22:45:50,096 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2022-01-18 22:45:50,096 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-01-18 22:45:50,096 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 283 flow [2022-01-18 22:45:50,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,097 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:50,097 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:50,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:45:50,098 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 425879587, now seen corresponding path program 1 times [2022-01-18 22:45:50,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351637753] [2022-01-18 22:45:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:50,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:50,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351637753] [2022-01-18 22:45:50,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351637753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:50,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:50,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:45:50,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939120500] [2022-01-18 22:45:50,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:50,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:45:50,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:45:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:45:50,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-01-18 22:45:50,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 116 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:50,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-01-18 22:45:50,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:50,554 INFO L129 PetriNetUnfolder]: 508/1233 cut-off events. [2022-01-18 22:45:50,554 INFO L130 PetriNetUnfolder]: For 855/859 co-relation queries the response was YES. [2022-01-18 22:45:50,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 1233 events. 508/1233 cut-off events. For 855/859 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7447 event pairs, 224 based on Foata normal form. 24/1205 useless extension candidates. Maximal degree in co-relation 2603. Up to 453 conditions per place. [2022-01-18 22:45:50,567 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 23 selfloop transitions, 3 changer transitions 31/156 dead transitions. [2022-01-18 22:45:50,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 503 flow [2022-01-18 22:45:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:45:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:45:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2022-01-18 22:45:50,570 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.886437908496732 [2022-01-18 22:45:50,570 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1085 transitions. [2022-01-18 22:45:50,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1085 transitions. [2022-01-18 22:45:50,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:50,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1085 transitions. [2022-01-18 22:45:50,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 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) [2022-01-18 22:45:50,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,611 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,611 INFO L186 Difference]: Start difference. First operand has 139 places, 116 transitions, 283 flow. Second operand 9 states and 1085 transitions. [2022-01-18 22:45:50,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 503 flow [2022-01-18 22:45:50,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 156 transitions, 486 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-18 22:45:50,618 INFO L242 Difference]: Finished difference. Result has 144 places, 118 transitions, 317 flow [2022-01-18 22:45:50,618 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=144, PETRI_TRANSITIONS=118} [2022-01-18 22:45:50,624 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 1 predicate places. [2022-01-18 22:45:50,624 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 118 transitions, 317 flow [2022-01-18 22:45:50,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,625 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:50,625 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:50,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:45:50,626 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash -7275883, now seen corresponding path program 1 times [2022-01-18 22:45:50,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:50,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775657337] [2022-01-18 22:45:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:50,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:50,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775657337] [2022-01-18 22:45:50,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775657337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:50,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:50,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:45:50,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956308904] [2022-01-18 22:45:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:50,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:45:50,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:50,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:45:50,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:45:50,762 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-01-18 22:45:50,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 118 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:50,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:50,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-01-18 22:45:50,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:51,136 INFO L129 PetriNetUnfolder]: 425/1245 cut-off events. [2022-01-18 22:45:51,136 INFO L130 PetriNetUnfolder]: For 1957/1969 co-relation queries the response was YES. [2022-01-18 22:45:51,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 1245 events. 425/1245 cut-off events. For 1957/1969 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8631 event pairs, 150 based on Foata normal form. 20/1203 useless extension candidates. Maximal degree in co-relation 3091. Up to 284 conditions per place. [2022-01-18 22:45:51,150 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 26 selfloop transitions, 3 changer transitions 22/150 dead transitions. [2022-01-18 22:45:51,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 150 transitions, 559 flow [2022-01-18 22:45:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:45:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:45:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-01-18 22:45:51,153 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2022-01-18 22:45:51,154 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-01-18 22:45:51,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-01-18 22:45:51,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:51,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-01-18 22:45:51,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,159 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,159 INFO L186 Difference]: Start difference. First operand has 144 places, 118 transitions, 317 flow. Second operand 9 states and 1078 transitions. [2022-01-18 22:45:51,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 150 transitions, 559 flow [2022-01-18 22:45:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 150 transitions, 528 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-01-18 22:45:51,167 INFO L242 Difference]: Finished difference. Result has 149 places, 118 transitions, 329 flow [2022-01-18 22:45:51,167 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=329, PETRI_PLACES=149, PETRI_TRANSITIONS=118} [2022-01-18 22:45:51,168 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 6 predicate places. [2022-01-18 22:45:51,168 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 118 transitions, 329 flow [2022-01-18 22:45:51,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,168 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:51,168 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:51,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:45:51,169 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash -661117452, now seen corresponding path program 1 times [2022-01-18 22:45:51,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:51,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162517799] [2022-01-18 22:45:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:51,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:51,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162517799] [2022-01-18 22:45:51,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162517799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:51,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:51,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:45:51,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132721081] [2022-01-18 22:45:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:51,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:45:51,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:45:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:45:51,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-01-18 22:45:51,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 118 transitions, 329 flow. Second operand has 10 states, 10 states have (on average 113.6) internal successors, (1136), 10 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:51,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-01-18 22:45:51,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:51,794 INFO L129 PetriNetUnfolder]: 416/1240 cut-off events. [2022-01-18 22:45:51,794 INFO L130 PetriNetUnfolder]: For 3880/3958 co-relation queries the response was YES. [2022-01-18 22:45:51,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 1240 events. 416/1240 cut-off events. For 3880/3958 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8971 event pairs, 191 based on Foata normal form. 42/1209 useless extension candidates. Maximal degree in co-relation 3472. Up to 360 conditions per place. [2022-01-18 22:45:51,806 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 18 selfloop transitions, 8 changer transitions 22/147 dead transitions. [2022-01-18 22:45:51,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 525 flow [2022-01-18 22:45:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:45:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:45:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1506 transitions. [2022-01-18 22:45:51,811 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518099547511312 [2022-01-18 22:45:51,811 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1506 transitions. [2022-01-18 22:45:51,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1506 transitions. [2022-01-18 22:45:51,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:51,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1506 transitions. [2022-01-18 22:45:51,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.84615384615384) internal successors, (1506), 13 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,818 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,818 INFO L186 Difference]: Start difference. First operand has 149 places, 118 transitions, 329 flow. Second operand 13 states and 1506 transitions. [2022-01-18 22:45:51,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 525 flow [2022-01-18 22:45:51,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 147 transitions, 488 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-01-18 22:45:51,828 INFO L242 Difference]: Finished difference. Result has 156 places, 122 transitions, 364 flow [2022-01-18 22:45:51,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=364, PETRI_PLACES=156, PETRI_TRANSITIONS=122} [2022-01-18 22:45:51,829 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-01-18 22:45:51,829 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 122 transitions, 364 flow [2022-01-18 22:45:51,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.6) internal successors, (1136), 10 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:51,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:51,829 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:51,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:45:51,830 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2041952902, now seen corresponding path program 1 times [2022-01-18 22:45:51,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293234825] [2022-01-18 22:45:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:51,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:52,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:52,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293234825] [2022-01-18 22:45:52,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293234825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:52,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:52,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:45:52,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050324468] [2022-01-18 22:45:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:52,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:45:52,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:45:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:45:52,017 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-01-18 22:45:52,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 122 transitions, 364 flow. Second operand has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:52,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-01-18 22:45:52,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:52,417 INFO L129 PetriNetUnfolder]: 368/1136 cut-off events. [2022-01-18 22:45:52,418 INFO L130 PetriNetUnfolder]: For 3808/3858 co-relation queries the response was YES. [2022-01-18 22:45:52,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3671 conditions, 1136 events. 368/1136 cut-off events. For 3808/3858 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7827 event pairs, 105 based on Foata normal form. 28/1099 useless extension candidates. Maximal degree in co-relation 3589. Up to 341 conditions per place. [2022-01-18 22:45:52,434 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 22 selfloop transitions, 10 changer transitions 19/150 dead transitions. [2022-01-18 22:45:52,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 624 flow [2022-01-18 22:45:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:45:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:45:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1394 transitions. [2022-01-18 22:45:52,437 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2022-01-18 22:45:52,438 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1394 transitions. [2022-01-18 22:45:52,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1394 transitions. [2022-01-18 22:45:52,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:52,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1394 transitions. [2022-01-18 22:45:52,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.16666666666667) internal successors, (1394), 12 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,444 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,445 INFO L186 Difference]: Start difference. First operand has 156 places, 122 transitions, 364 flow. Second operand 12 states and 1394 transitions. [2022-01-18 22:45:52,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 624 flow [2022-01-18 22:45:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 150 transitions, 604 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-01-18 22:45:52,451 INFO L242 Difference]: Finished difference. Result has 163 places, 127 transitions, 433 flow [2022-01-18 22:45:52,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=433, PETRI_PLACES=163, PETRI_TRANSITIONS=127} [2022-01-18 22:45:52,452 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2022-01-18 22:45:52,452 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 127 transitions, 433 flow [2022-01-18 22:45:52,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:52,453 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:52,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:45:52,453 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1425022626, now seen corresponding path program 2 times [2022-01-18 22:45:52,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:52,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803621935] [2022-01-18 22:45:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:52,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:52,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803621935] [2022-01-18 22:45:52,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803621935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:52,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:52,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:45:52,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391058049] [2022-01-18 22:45:52,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:52,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:45:52,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:52,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:45:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:45:52,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-01-18 22:45:52,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 127 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:52,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:52,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-01-18 22:45:52,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:53,000 INFO L129 PetriNetUnfolder]: 372/1185 cut-off events. [2022-01-18 22:45:53,001 INFO L130 PetriNetUnfolder]: For 7614/7786 co-relation queries the response was YES. [2022-01-18 22:45:53,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4964 conditions, 1185 events. 372/1185 cut-off events. For 7614/7786 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8573 event pairs, 114 based on Foata normal form. 39/1154 useless extension candidates. Maximal degree in co-relation 4878. Up to 287 conditions per place. [2022-01-18 22:45:53,018 INFO L132 encePairwiseOnDemand]: 127/136 looper letters, 26 selfloop transitions, 10 changer transitions 19/155 dead transitions. [2022-01-18 22:45:53,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 155 transitions, 871 flow [2022-01-18 22:45:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:45:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:45:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1291 transitions. [2022-01-18 22:45:53,022 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629679144385026 [2022-01-18 22:45:53,022 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1291 transitions. [2022-01-18 22:45:53,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1291 transitions. [2022-01-18 22:45:53,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:53,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1291 transitions. [2022-01-18 22:45:53,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,028 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,029 INFO L186 Difference]: Start difference. First operand has 163 places, 127 transitions, 433 flow. Second operand 11 states and 1291 transitions. [2022-01-18 22:45:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 155 transitions, 871 flow [2022-01-18 22:45:53,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 155 transitions, 833 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-01-18 22:45:53,038 INFO L242 Difference]: Finished difference. Result has 169 places, 129 transitions, 498 flow [2022-01-18 22:45:53,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=498, PETRI_PLACES=169, PETRI_TRANSITIONS=129} [2022-01-18 22:45:53,039 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 26 predicate places. [2022-01-18 22:45:53,039 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 129 transitions, 498 flow [2022-01-18 22:45:53,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,040 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:53,040 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:53,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:45:53,040 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1024198239, now seen corresponding path program 1 times [2022-01-18 22:45:53,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446103047] [2022-01-18 22:45:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:53,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:53,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:53,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446103047] [2022-01-18 22:45:53,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446103047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:53,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:53,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:45:53,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848441875] [2022-01-18 22:45:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:53,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:45:53,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:45:53,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:45:53,248 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:45:53,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 129 transitions, 498 flow. Second operand has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:53,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:45:53,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:53,634 INFO L129 PetriNetUnfolder]: 290/1019 cut-off events. [2022-01-18 22:45:53,634 INFO L130 PetriNetUnfolder]: For 9490/9566 co-relation queries the response was YES. [2022-01-18 22:45:53,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 1019 events. 290/1019 cut-off events. For 9490/9566 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6818 event pairs, 89 based on Foata normal form. 36/991 useless extension candidates. Maximal degree in co-relation 4515. Up to 340 conditions per place. [2022-01-18 22:45:53,655 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 25 selfloop transitions, 14 changer transitions 10/147 dead transitions. [2022-01-18 22:45:53,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 147 transitions, 816 flow [2022-01-18 22:45:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:45:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:45:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1599 transitions. [2022-01-18 22:45:53,659 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8398109243697479 [2022-01-18 22:45:53,659 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1599 transitions. [2022-01-18 22:45:53,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1599 transitions. [2022-01-18 22:45:53,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:53,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1599 transitions. [2022-01-18 22:45:53,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.21428571428571) internal successors, (1599), 14 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,667 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,667 INFO L186 Difference]: Start difference. First operand has 169 places, 129 transitions, 498 flow. Second operand 14 states and 1599 transitions. [2022-01-18 22:45:53,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 147 transitions, 816 flow [2022-01-18 22:45:53,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 147 transitions, 671 flow, removed 66 selfloop flow, removed 12 redundant places. [2022-01-18 22:45:53,680 INFO L242 Difference]: Finished difference. Result has 172 places, 132 transitions, 517 flow [2022-01-18 22:45:53,680 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=517, PETRI_PLACES=172, PETRI_TRANSITIONS=132} [2022-01-18 22:45:53,684 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 29 predicate places. [2022-01-18 22:45:53,684 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 132 transitions, 517 flow [2022-01-18 22:45:53,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:53,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:53,685 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:53,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:45:53,686 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash -155459675, now seen corresponding path program 2 times [2022-01-18 22:45:53,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:53,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169738463] [2022-01-18 22:45:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:53,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:54,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:54,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169738463] [2022-01-18 22:45:54,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169738463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:54,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:54,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-18 22:45:54,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429656963] [2022-01-18 22:45:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:54,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 22:45:54,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 22:45:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-18 22:45:54,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:45:54,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 132 transitions, 517 flow. Second operand has 15 states, 15 states have (on average 110.4) internal successors, (1656), 15 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:54,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:45:54,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:54,496 INFO L129 PetriNetUnfolder]: 296/1028 cut-off events. [2022-01-18 22:45:54,496 INFO L130 PetriNetUnfolder]: For 6711/6903 co-relation queries the response was YES. [2022-01-18 22:45:54,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 1028 events. 296/1028 cut-off events. For 6711/6903 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6927 event pairs, 95 based on Foata normal form. 36/994 useless extension candidates. Maximal degree in co-relation 4218. Up to 337 conditions per place. [2022-01-18 22:45:54,513 INFO L132 encePairwiseOnDemand]: 122/136 looper letters, 26 selfloop transitions, 17 changer transitions 10/149 dead transitions. [2022-01-18 22:45:54,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 149 transitions, 827 flow [2022-01-18 22:45:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 22:45:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-18 22:45:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1898 transitions. [2022-01-18 22:45:54,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8209342560553633 [2022-01-18 22:45:54,517 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1898 transitions. [2022-01-18 22:45:54,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1898 transitions. [2022-01-18 22:45:54,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:54,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1898 transitions. [2022-01-18 22:45:54,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 111.6470588235294) internal successors, (1898), 17 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,526 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,526 INFO L186 Difference]: Start difference. First operand has 172 places, 132 transitions, 517 flow. Second operand 17 states and 1898 transitions. [2022-01-18 22:45:54,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 149 transitions, 827 flow [2022-01-18 22:45:54,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 149 transitions, 743 flow, removed 35 selfloop flow, removed 10 redundant places. [2022-01-18 22:45:54,537 INFO L242 Difference]: Finished difference. Result has 179 places, 134 transitions, 564 flow [2022-01-18 22:45:54,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=564, PETRI_PLACES=179, PETRI_TRANSITIONS=134} [2022-01-18 22:45:54,538 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 36 predicate places. [2022-01-18 22:45:54,538 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 134 transitions, 564 flow [2022-01-18 22:45:54,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 110.4) internal successors, (1656), 15 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,539 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:54,539 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:54,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:45:54,539 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1898099809, now seen corresponding path program 3 times [2022-01-18 22:45:54,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:54,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704878252] [2022-01-18 22:45:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:54,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:54,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704878252] [2022-01-18 22:45:54,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704878252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:54,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:54,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:45:54,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890907990] [2022-01-18 22:45:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:54,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:45:54,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:54,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:45:54,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:45:54,730 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:45:54,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 134 transitions, 564 flow. Second operand has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:54,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:54,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:45:54,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:55,205 INFO L129 PetriNetUnfolder]: 270/1151 cut-off events. [2022-01-18 22:45:55,206 INFO L130 PetriNetUnfolder]: For 6679/6800 co-relation queries the response was YES. [2022-01-18 22:45:55,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 1151 events. 270/1151 cut-off events. For 6679/6800 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8653 event pairs, 62 based on Foata normal form. 65/1157 useless extension candidates. Maximal degree in co-relation 4310. Up to 176 conditions per place. [2022-01-18 22:45:55,223 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 30 selfloop transitions, 24 changer transitions 10/162 dead transitions. [2022-01-18 22:45:55,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 162 transitions, 991 flow [2022-01-18 22:45:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 22:45:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-18 22:45:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1943 transitions. [2022-01-18 22:45:55,226 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8403979238754326 [2022-01-18 22:45:55,226 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1943 transitions. [2022-01-18 22:45:55,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1943 transitions. [2022-01-18 22:45:55,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:55,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1943 transitions. [2022-01-18 22:45:55,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.29411764705883) internal successors, (1943), 17 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:55,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:55,234 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:55,234 INFO L186 Difference]: Start difference. First operand has 179 places, 134 transitions, 564 flow. Second operand 17 states and 1943 transitions. [2022-01-18 22:45:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 162 transitions, 991 flow [2022-01-18 22:45:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 162 transitions, 858 flow, removed 46 selfloop flow, removed 17 redundant places. [2022-01-18 22:45:55,248 INFO L242 Difference]: Finished difference. Result has 180 places, 139 transitions, 637 flow [2022-01-18 22:45:55,248 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=637, PETRI_PLACES=180, PETRI_TRANSITIONS=139} [2022-01-18 22:45:55,248 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2022-01-18 22:45:55,249 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 139 transitions, 637 flow [2022-01-18 22:45:55,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:55,250 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:55,250 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:55,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:45:55,250 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1022661405, now seen corresponding path program 1 times [2022-01-18 22:45:55,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591567817] [2022-01-18 22:45:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:55,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:55,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591567817] [2022-01-18 22:45:55,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591567817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:55,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:55,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:45:55,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973065500] [2022-01-18 22:45:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:55,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:45:55,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:45:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:45:55,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:45:55,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 139 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:55,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:55,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:45:55,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:57,436 INFO L129 PetriNetUnfolder]: 7039/12809 cut-off events. [2022-01-18 22:45:57,436 INFO L130 PetriNetUnfolder]: For 72107/73621 co-relation queries the response was YES. [2022-01-18 22:45:57,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43822 conditions, 12809 events. 7039/12809 cut-off events. For 72107/73621 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 111943 event pairs, 315 based on Foata normal form. 861/12852 useless extension candidates. Maximal degree in co-relation 43731. Up to 4753 conditions per place. [2022-01-18 22:45:57,663 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 148 selfloop transitions, 18 changer transitions 5/270 dead transitions. [2022-01-18 22:45:57,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 270 transitions, 2206 flow [2022-01-18 22:45:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:45:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:45:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1194 transitions. [2022-01-18 22:45:57,666 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8779411764705882 [2022-01-18 22:45:57,666 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1194 transitions. [2022-01-18 22:45:57,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1194 transitions. [2022-01-18 22:45:57,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:45:57,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1194 transitions. [2022-01-18 22:45:57,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.4) internal successors, (1194), 10 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:57,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:57,670 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:57,670 INFO L186 Difference]: Start difference. First operand has 180 places, 139 transitions, 637 flow. Second operand 10 states and 1194 transitions. [2022-01-18 22:45:57,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 270 transitions, 2206 flow [2022-01-18 22:45:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 270 transitions, 2105 flow, removed 24 selfloop flow, removed 13 redundant places. [2022-01-18 22:45:57,768 INFO L242 Difference]: Finished difference. Result has 176 places, 155 transitions, 731 flow [2022-01-18 22:45:57,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=731, PETRI_PLACES=176, PETRI_TRANSITIONS=155} [2022-01-18 22:45:57,769 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 33 predicate places. [2022-01-18 22:45:57,769 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 155 transitions, 731 flow [2022-01-18 22:45:57,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:57,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:45:57,770 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:45:57,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 22:45:57,770 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:45:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:45:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1515277567, now seen corresponding path program 1 times [2022-01-18 22:45:57,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:45:57,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768408820] [2022-01-18 22:45:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:45:57,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:45:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:45:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:45:57,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:45:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768408820] [2022-01-18 22:45:57,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768408820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:45:57,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:45:57,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:45:57,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470668401] [2022-01-18 22:45:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:45:57,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:45:57,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:45:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:45:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:45:57,868 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:45:57,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 155 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:45:57,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:45:57,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:45:57,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:45:59,928 INFO L129 PetriNetUnfolder]: 6789/12913 cut-off events. [2022-01-18 22:45:59,929 INFO L130 PetriNetUnfolder]: For 80432/81837 co-relation queries the response was YES. [2022-01-18 22:45:59,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56851 conditions, 12913 events. 6789/12913 cut-off events. For 80432/81837 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 119734 event pairs, 119 based on Foata normal form. 1116/13511 useless extension candidates. Maximal degree in co-relation 56762. Up to 4315 conditions per place. [2022-01-18 22:46:00,038 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 173 selfloop transitions, 34 changer transitions 26/332 dead transitions. [2022-01-18 22:46:00,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 332 transitions, 3037 flow [2022-01-18 22:46:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:46:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:46:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1553 transitions. [2022-01-18 22:46:00,045 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.878393665158371 [2022-01-18 22:46:00,045 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1553 transitions. [2022-01-18 22:46:00,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1553 transitions. [2022-01-18 22:46:00,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:00,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1553 transitions. [2022-01-18 22:46:00,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.46153846153847) internal successors, (1553), 13 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:00,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:00,053 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:00,053 INFO L186 Difference]: Start difference. First operand has 176 places, 155 transitions, 731 flow. Second operand 13 states and 1553 transitions. [2022-01-18 22:46:00,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 332 transitions, 3037 flow [2022-01-18 22:46:00,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 332 transitions, 3035 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 22:46:00,177 INFO L242 Difference]: Finished difference. Result has 193 places, 173 transitions, 993 flow [2022-01-18 22:46:00,177 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=993, PETRI_PLACES=193, PETRI_TRANSITIONS=173} [2022-01-18 22:46:00,178 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 50 predicate places. [2022-01-18 22:46:00,178 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 173 transitions, 993 flow [2022-01-18 22:46:00,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:00,178 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:00,178 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:00,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 22:46:00,179 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:00,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:00,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2011447838, now seen corresponding path program 1 times [2022-01-18 22:46:00,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:00,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639233506] [2022-01-18 22:46:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:00,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:00,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639233506] [2022-01-18 22:46:00,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639233506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:00,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:00,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:46:00,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278325836] [2022-01-18 22:46:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:00,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:46:00,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:46:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:46:00,269 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-01-18 22:46:00,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 173 transitions, 993 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:00,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:00,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-01-18 22:46:00,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:01,755 INFO L129 PetriNetUnfolder]: 2389/9314 cut-off events. [2022-01-18 22:46:01,755 INFO L130 PetriNetUnfolder]: For 38332/49087 co-relation queries the response was YES. [2022-01-18 22:46:01,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35937 conditions, 9314 events. 2389/9314 cut-off events. For 38332/49087 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 119414 event pairs, 293 based on Foata normal form. 264/8932 useless extension candidates. Maximal degree in co-relation 35840. Up to 2867 conditions per place. [2022-01-18 22:46:01,847 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 71 selfloop transitions, 11 changer transitions 8/225 dead transitions. [2022-01-18 22:46:01,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 225 transitions, 1721 flow [2022-01-18 22:46:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:46:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:46:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1073 transitions. [2022-01-18 22:46:01,849 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8766339869281046 [2022-01-18 22:46:01,849 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1073 transitions. [2022-01-18 22:46:01,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1073 transitions. [2022-01-18 22:46:01,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:01,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1073 transitions. [2022-01-18 22:46:01,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:01,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:01,853 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:01,853 INFO L186 Difference]: Start difference. First operand has 193 places, 173 transitions, 993 flow. Second operand 9 states and 1073 transitions. [2022-01-18 22:46:01,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 225 transitions, 1721 flow [2022-01-18 22:46:02,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 225 transitions, 1632 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:02,260 INFO L242 Difference]: Finished difference. Result has 204 places, 181 transitions, 1039 flow [2022-01-18 22:46:02,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=204, PETRI_TRANSITIONS=181} [2022-01-18 22:46:02,260 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 61 predicate places. [2022-01-18 22:46:02,260 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 181 transitions, 1039 flow [2022-01-18 22:46:02,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:02,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:02,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:02,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 22:46:02,261 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1515594460, now seen corresponding path program 1 times [2022-01-18 22:46:02,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:02,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764298566] [2022-01-18 22:46:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:02,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:02,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:02,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764298566] [2022-01-18 22:46:02,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764298566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:02,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:02,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:46:02,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027265469] [2022-01-18 22:46:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:02,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:46:02,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:46:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:46:02,358 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:02,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 181 transitions, 1039 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:02,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:02,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:02,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:05,120 INFO L129 PetriNetUnfolder]: 9157/18034 cut-off events. [2022-01-18 22:46:05,121 INFO L130 PetriNetUnfolder]: For 151821/154028 co-relation queries the response was YES. [2022-01-18 22:46:05,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89412 conditions, 18034 events. 9157/18034 cut-off events. For 151821/154028 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 185415 event pairs, 44 based on Foata normal form. 1552/18876 useless extension candidates. Maximal degree in co-relation 89309. Up to 4481 conditions per place. [2022-01-18 22:46:05,324 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 76 selfloop transitions, 15 changer transitions 174/364 dead transitions. [2022-01-18 22:46:05,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 364 transitions, 3652 flow [2022-01-18 22:46:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:46:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:46:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1911 transitions. [2022-01-18 22:46:05,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8782169117647058 [2022-01-18 22:46:05,327 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1911 transitions. [2022-01-18 22:46:05,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1911 transitions. [2022-01-18 22:46:05,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:05,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1911 transitions. [2022-01-18 22:46:05,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.4375) internal successors, (1911), 16 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:05,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:05,332 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:05,332 INFO L186 Difference]: Start difference. First operand has 204 places, 181 transitions, 1039 flow. Second operand 16 states and 1911 transitions. [2022-01-18 22:46:05,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 364 transitions, 3652 flow [2022-01-18 22:46:06,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 364 transitions, 3506 flow, removed 62 selfloop flow, removed 2 redundant places. [2022-01-18 22:46:06,171 INFO L242 Difference]: Finished difference. Result has 223 places, 143 transitions, 783 flow [2022-01-18 22:46:06,172 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=783, PETRI_PLACES=223, PETRI_TRANSITIONS=143} [2022-01-18 22:46:06,172 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 80 predicate places. [2022-01-18 22:46:06,172 INFO L470 AbstractCegarLoop]: Abstraction has has 223 places, 143 transitions, 783 flow [2022-01-18 22:46:06,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:06,173 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:06,173 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:06,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 22:46:06,173 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 884278511, now seen corresponding path program 1 times [2022-01-18 22:46:06,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:06,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116758251] [2022-01-18 22:46:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:06,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:06,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:06,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116758251] [2022-01-18 22:46:06,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116758251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:06,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:06,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:46:06,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462425070] [2022-01-18 22:46:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:06,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:46:06,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:46:06,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:46:06,332 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:06,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 143 transitions, 783 flow. Second operand has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:06,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:06,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:06,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:06,956 INFO L129 PetriNetUnfolder]: 831/2461 cut-off events. [2022-01-18 22:46:06,956 INFO L130 PetriNetUnfolder]: For 19977/20140 co-relation queries the response was YES. [2022-01-18 22:46:06,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11501 conditions, 2461 events. 831/2461 cut-off events. For 19977/20140 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21154 event pairs, 3 based on Foata normal form. 143/2489 useless extension candidates. Maximal degree in co-relation 11444. Up to 633 conditions per place. [2022-01-18 22:46:06,971 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 57 selfloop transitions, 19 changer transitions 34/206 dead transitions. [2022-01-18 22:46:06,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 206 transitions, 1735 flow [2022-01-18 22:46:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:46:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:46:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1402 transitions. [2022-01-18 22:46:06,981 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8590686274509803 [2022-01-18 22:46:06,981 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1402 transitions. [2022-01-18 22:46:06,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1402 transitions. [2022-01-18 22:46:06,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:06,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1402 transitions. [2022-01-18 22:46:06,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.83333333333333) internal successors, (1402), 12 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:06,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:06,985 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:06,986 INFO L186 Difference]: Start difference. First operand has 223 places, 143 transitions, 783 flow. Second operand 12 states and 1402 transitions. [2022-01-18 22:46:06,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 206 transitions, 1735 flow [2022-01-18 22:46:07,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 206 transitions, 1257 flow, removed 183 selfloop flow, removed 37 redundant places. [2022-01-18 22:46:07,031 INFO L242 Difference]: Finished difference. Result has 176 places, 137 transitions, 560 flow [2022-01-18 22:46:07,031 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=560, PETRI_PLACES=176, PETRI_TRANSITIONS=137} [2022-01-18 22:46:07,031 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 33 predicate places. [2022-01-18 22:46:07,033 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 137 transitions, 560 flow [2022-01-18 22:46:07,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,033 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:07,033 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:07,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 22:46:07,034 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 833657765, now seen corresponding path program 1 times [2022-01-18 22:46:07,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767086488] [2022-01-18 22:46:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:07,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:07,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:07,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767086488] [2022-01-18 22:46:07,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767086488] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:07,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:07,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:07,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582127866] [2022-01-18 22:46:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:07,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:07,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:07,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-01-18 22:46:07,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 137 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:07,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-01-18 22:46:07,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:07,341 INFO L129 PetriNetUnfolder]: 166/798 cut-off events. [2022-01-18 22:46:07,342 INFO L130 PetriNetUnfolder]: For 1149/1278 co-relation queries the response was YES. [2022-01-18 22:46:07,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 798 events. 166/798 cut-off events. For 1149/1278 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5209 event pairs, 5 based on Foata normal form. 7/766 useless extension candidates. Maximal degree in co-relation 2057. Up to 129 conditions per place. [2022-01-18 22:46:07,347 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 19 selfloop transitions, 1 changer transitions 39/166 dead transitions. [2022-01-18 22:46:07,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 883 flow [2022-01-18 22:46:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2022-01-18 22:46:07,349 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2022-01-18 22:46:07,349 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2022-01-18 22:46:07,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2022-01-18 22:46:07,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:07,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2022-01-18 22:46:07,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,352 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,352 INFO L186 Difference]: Start difference. First operand has 176 places, 137 transitions, 560 flow. Second operand 7 states and 824 transitions. [2022-01-18 22:46:07,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 883 flow [2022-01-18 22:46:07,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 166 transitions, 680 flow, removed 45 selfloop flow, removed 27 redundant places. [2022-01-18 22:46:07,360 INFO L242 Difference]: Finished difference. Result has 156 places, 127 transitions, 343 flow [2022-01-18 22:46:07,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=156, PETRI_TRANSITIONS=127} [2022-01-18 22:46:07,360 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-01-18 22:46:07,360 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 127 transitions, 343 flow [2022-01-18 22:46:07,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:07,361 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:07,361 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:07,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 22:46:07,361 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1369951889, now seen corresponding path program 2 times [2022-01-18 22:46:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:07,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097502695] [2022-01-18 22:46:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:07,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:46:07,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:46:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:46:07,477 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:46:07,478 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:46:07,478 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-18 22:46:07,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-18 22:46:07,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-18 22:46:07,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-18 22:46:07,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-18 22:46:07,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-18 22:46:07,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-18 22:46:07,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 22:46:07,487 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:07,491 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:46:07,491 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:46:07,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:46:07 BasicIcfg [2022-01-18 22:46:07,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:46:07,651 INFO L158 Benchmark]: Toolchain (without parser) took 21046.62ms. Allocated memory was 383.8MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 327.8MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 833.7MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,651 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 383.8MB. Free memory is still 346.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:46:07,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.93ms. Allocated memory is still 383.8MB. Free memory was 327.6MB in the beginning and 341.0MB in the end (delta: -13.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 383.8MB. Free memory was 341.0MB in the beginning and 337.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,652 INFO L158 Benchmark]: Boogie Preprocessor took 46.64ms. Allocated memory is still 383.8MB. Free memory was 337.8MB in the beginning and 335.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,652 INFO L158 Benchmark]: RCFGBuilder took 914.07ms. Allocated memory is still 383.8MB. Free memory was 335.7MB in the beginning and 262.3MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,652 INFO L158 Benchmark]: TraceAbstraction took 19413.47ms. Allocated memory was 383.8MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 262.3MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 767.4MB. Max. memory is 16.0GB. [2022-01-18 22:46:07,653 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.18ms. Allocated memory is still 383.8MB. Free memory is still 346.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 609.93ms. Allocated memory is still 383.8MB. Free memory was 327.6MB in the beginning and 341.0MB in the end (delta: -13.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 383.8MB. Free memory was 341.0MB in the beginning and 337.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.64ms. Allocated memory is still 383.8MB. Free memory was 337.8MB in the beginning and 335.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 914.07ms. Allocated memory is still 383.8MB. Free memory was 335.7MB in the beginning and 262.3MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 19413.47ms. Allocated memory was 383.8MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 262.3MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 767.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-3, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-2, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 851 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 669 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1210 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1909 IncrementalHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 138 mSDtfsCounter, 1909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1039occurred in iteration=14, InterpolantAutomatonStates: 190, 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.1s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1691 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1569 ConstructedInterpolants, 0 QuantifiedInterpolants, 7347 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! [2022-01-18 22:46:07,688 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...