/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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:53:24,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:53:24,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:53:24,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:53:24,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:53:24,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:53:24,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:53:24,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:53:24,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:53:24,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:53:24,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:53:24,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:53:24,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:53:24,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:53:24,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:53:24,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:53:24,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:53:24,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:53:24,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:53:24,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:53:24,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:53:24,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:53:24,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:53:24,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:53:24,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:53:24,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:53:24,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:53:24,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:53:24,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:53:24,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:53:24,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:53:24,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:53:24,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:53:24,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:53:24,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:53:24,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:53:24,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:53:24,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:53:24,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:53:24,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:53:24,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:53:24,458 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:53:24,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:53:24,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:53:24,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:53:24,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:53:24,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:53:24,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:53:24,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:53:24,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:53:24,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:53:24,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:53:24,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:53:24,488 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:53:24,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:53:24,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:53:24,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:53:24,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:53:24,706 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:53:24,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-18 22:53:24,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63d558ca/93ae8f01f68744949feb29bee6119d2d/FLAGe8b4bf39a [2022-01-18 22:53:25,217 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:53:25,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-18 22:53:25,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63d558ca/93ae8f01f68744949feb29bee6119d2d/FLAGe8b4bf39a [2022-01-18 22:53:25,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63d558ca/93ae8f01f68744949feb29bee6119d2d [2022-01-18 22:53:25,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:53:25,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:53:25,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:53:25,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:53:25,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:53:25,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:53:25" (1/1) ... [2022-01-18 22:53:25,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a1dd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:25, skipping insertion in model container [2022-01-18 22:53:25,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:53:25" (1/1) ... [2022-01-18 22:53:25,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:53:25,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:53:25,933 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-01-18 22:53:26,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:53:26,135 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:53:26,150 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-01-18 22:53:26,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:53:26,261 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:53:26,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26 WrapperNode [2022-01-18 22:53:26,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:53:26,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:53:26,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:53:26,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:53:26,270 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:53:26" (1/1) ... [2022-01-18 22:53:26,299 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:53:26" (1/1) ... [2022-01-18 22:53:26,323 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-18 22:53:26,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:53:26,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:53:26,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:53:26,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:53:26,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:53:26,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:53:26,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:53:26,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:53:26,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (1/1) ... [2022-01-18 22:53:26,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:53:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:53:26,397 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:53:26,399 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:53:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:53:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:53:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:53:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:53:26,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:53:26,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:53:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:53:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:53:26,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:53:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:53:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:53:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:53:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:53:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:53:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:53:26,436 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:53:26,602 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:53:26,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:53:27,243 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:53:27,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:53:27,637 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:53:27,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:53:27 BoogieIcfgContainer [2022-01-18 22:53:27,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:53:27,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:53:27,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:53:27,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:53:27,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:53:25" (1/3) ... [2022-01-18 22:53:27,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd4b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:53:27, skipping insertion in model container [2022-01-18 22:53:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:53:26" (2/3) ... [2022-01-18 22:53:27,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd4b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:53:27, skipping insertion in model container [2022-01-18 22:53:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:53:27" (3/3) ... [2022-01-18 22:53:27,646 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-18 22:53:27,649 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:53:27,650 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:53:27,650 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:53:27,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,696 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,707 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,707 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,712 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,713 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,714 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,714 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,714 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,714 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,714 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,715 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,716 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,724 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,724 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,724 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,724 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,725 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,730 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,732 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,737 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,737 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,737 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,737 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,737 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,738 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,742 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,743 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,744 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:53:27,748 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:53:27,791 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:53:27,797 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:53:27,798 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:53:27,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-01-18 22:53:27,859 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-01-18 22:53:27,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:53:27,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-18 22:53:27,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-01-18 22:53:27,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-01-18 22:53:27,883 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2022-01-18 22:53:27,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:53:27,884 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:27,884 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] [2022-01-18 22:53:27,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1547640948, now seen corresponding path program 1 times [2022-01-18 22:53:27,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:27,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950704504] [2022-01-18 22:53:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:27,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:28,165 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:53:28,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:28,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950704504] [2022-01-18 22:53:28,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950704504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:28,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:28,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:53:28,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017093234] [2022-01-18 22:53:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:28,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:53:28,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:28,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:53:28,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:53:28,199 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-01-18 22:53:28,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:53:28,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:28,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-01-18 22:53:28,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:28,394 INFO L129 PetriNetUnfolder]: 126/549 cut-off events. [2022-01-18 22:53:28,394 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-18 22:53:28,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2889 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. [2022-01-18 22:53:28,401 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-01-18 22:53:28,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow [2022-01-18 22:53:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:53:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:53:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-01-18 22:53:28,414 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2022-01-18 22:53:28,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-01-18 22:53:28,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-01-18 22:53:28,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:28,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-01-18 22:53:28,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:53:28,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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:53:28,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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:53:28,438 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions. [2022-01-18 22:53:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow [2022-01-18 22:53:28,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:53:28,444 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-01-18 22:53:28,445 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-01-18 22:53:28,447 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-01-18 22:53:28,448 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-01-18 22:53:28,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:53:28,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:28,448 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] [2022-01-18 22:53:28,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:53:28,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash 84128766, now seen corresponding path program 1 times [2022-01-18 22:53:28,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:28,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066185725] [2022-01-18 22:53:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:28,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:28,627 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:53:28,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:28,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066185725] [2022-01-18 22:53:28,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066185725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:28,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:28,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:53:28,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281738096] [2022-01-18 22:53:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:28,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:53:28,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:53:28,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:53:28,631 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-01-18 22:53:28,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:53:28,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:28,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-01-18 22:53:28,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:29,014 INFO L129 PetriNetUnfolder]: 418/1209 cut-off events. [2022-01-18 22:53:29,015 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-01-18 22:53:29,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 1209 events. 418/1209 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8118 event pairs, 70 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 1934. Up to 267 conditions per place. [2022-01-18 22:53:29,025 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 48/148 dead transitions. [2022-01-18 22:53:29,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 440 flow [2022-01-18 22:53:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:53:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:53:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2022-01-18 22:53:29,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8664717348927875 [2022-01-18 22:53:29,029 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 889 transitions. [2022-01-18 22:53:29,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions. [2022-01-18 22:53:29,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:29,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions. [2022-01-18 22:53:29,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 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:53:29,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:29,034 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:29,034 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 889 transitions. [2022-01-18 22:53:29,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 440 flow [2022-01-18 22:53:29,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 148 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:53:29,039 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-01-18 22:53:29,039 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-01-18 22:53:29,040 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-01-18 22:53:29,040 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-01-18 22:53:29,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:53:29,040 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:29,041 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] [2022-01-18 22:53:29,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:53:29,041 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash -854671236, now seen corresponding path program 1 times [2022-01-18 22:53:29,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:29,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316670822] [2022-01-18 22:53:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:29,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:29,198 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:53:29,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:29,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316670822] [2022-01-18 22:53:29,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316670822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:29,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:29,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:53:29,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372439240] [2022-01-18 22:53:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:29,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:53:29,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:29,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:53:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:53:29,202 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-18 22:53:29,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:53:29,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:29,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-18 22:53:29,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:29,505 INFO L129 PetriNetUnfolder]: 524/1135 cut-off events. [2022-01-18 22:53:29,505 INFO L130 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-01-18 22:53:29,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1135 events. 524/1135 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6111 event pairs, 282 based on Foata normal form. 24/1100 useless extension candidates. Maximal degree in co-relation 2247. Up to 536 conditions per place. [2022-01-18 22:53:29,511 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 37/141 dead transitions. [2022-01-18 22:53:29,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 141 transitions, 463 flow [2022-01-18 22:53:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:53:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:53:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2022-01-18 22:53:29,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.854775828460039 [2022-01-18 22:53:29,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2022-01-18 22:53:29,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2022-01-18 22:53:29,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:29,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2022-01-18 22:53:29,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 0 states have call successors, (0), 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:53:29,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:29,517 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:29,518 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 877 transitions. [2022-01-18 22:53:29,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 141 transitions, 463 flow [2022-01-18 22:53:29,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 141 transitions, 429 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:53:29,523 INFO L242 Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow [2022-01-18 22:53:29,523 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2022-01-18 22:53:29,531 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2022-01-18 22:53:29,531 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow [2022-01-18 22:53:29,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:53:29,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:29,532 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] [2022-01-18 22:53:29,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:53:29,532 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1519173115, now seen corresponding path program 1 times [2022-01-18 22:53:29,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105369605] [2022-01-18 22:53:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:29,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:29,896 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:53:29,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105369605] [2022-01-18 22:53:29,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105369605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:29,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:29,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 22:53:29,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933956648] [2022-01-18 22:53:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:29,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 22:53:29,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 22:53:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-18 22:53:29,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-18 22:53:29,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 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:53:29,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:29,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-18 22:53:29,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:30,402 INFO L129 PetriNetUnfolder]: 417/993 cut-off events. [2022-01-18 22:53:30,403 INFO L130 PetriNetUnfolder]: For 795/795 co-relation queries the response was YES. [2022-01-18 22:53:30,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 993 events. 417/993 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5381 event pairs, 49 based on Foata normal form. 27/961 useless extension candidates. Maximal degree in co-relation 2237. Up to 308 conditions per place. [2022-01-18 22:53:30,409 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 29 selfloop transitions, 12 changer transitions 38/153 dead transitions. [2022-01-18 22:53:30,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 550 flow [2022-01-18 22:53:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-18 22:53:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-18 22:53:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1630 transitions. [2022-01-18 22:53:30,413 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7943469785575049 [2022-01-18 22:53:30,413 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1630 transitions. [2022-01-18 22:53:30,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1630 transitions. [2022-01-18 22:53:30,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:30,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1630 transitions. [2022-01-18 22:53:30,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.55555555555556) internal successors, (1630), 18 states have internal predecessors, (1630), 0 states have call successors, (0), 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:53:30,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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:53:30,420 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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:53:30,420 INFO L186 Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 18 states and 1630 transitions. [2022-01-18 22:53:30,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 550 flow [2022-01-18 22:53:30,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 529 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-18 22:53:30,425 INFO L242 Difference]: Finished difference. Result has 138 places, 104 transitions, 335 flow [2022-01-18 22:53:30,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=335, PETRI_PLACES=138, PETRI_TRANSITIONS=104} [2022-01-18 22:53:30,425 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-01-18 22:53:30,426 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 335 flow [2022-01-18 22:53:30,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 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:53:30,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:30,426 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] [2022-01-18 22:53:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:53:30,427 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1270785456, now seen corresponding path program 1 times [2022-01-18 22:53:30,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851197874] [2022-01-18 22:53:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:30,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:30,550 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:53:30,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:30,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851197874] [2022-01-18 22:53:30,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851197874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:30,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:30,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:53:30,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121065667] [2022-01-18 22:53:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:30,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:53:30,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:30,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:53:30,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:53:30,552 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-18 22:53:30,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 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:53:30,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:30,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-18 22:53:30,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:30,934 INFO L129 PetriNetUnfolder]: 569/1297 cut-off events. [2022-01-18 22:53:30,934 INFO L130 PetriNetUnfolder]: For 4490/4498 co-relation queries the response was YES. [2022-01-18 22:53:30,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 1297 events. 569/1297 cut-off events. For 4490/4498 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7685 event pairs, 182 based on Foata normal form. 20/1238 useless extension candidates. Maximal degree in co-relation 4944. Up to 467 conditions per place. [2022-01-18 22:53:30,942 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 36 selfloop transitions, 3 changer transitions 29/145 dead transitions. [2022-01-18 22:53:30,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 821 flow [2022-01-18 22:53:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:53:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:53:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2022-01-18 22:53:30,944 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-01-18 22:53:30,944 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2022-01-18 22:53:30,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2022-01-18 22:53:30,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:30,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2022-01-18 22:53:30,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 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:53:30,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:30,948 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:30,948 INFO L186 Difference]: Start difference. First operand has 138 places, 104 transitions, 335 flow. Second operand 9 states and 870 transitions. [2022-01-18 22:53:30,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 821 flow [2022-01-18 22:53:30,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 758 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-01-18 22:53:30,955 INFO L242 Difference]: Finished difference. Result has 134 places, 104 transitions, 332 flow [2022-01-18 22:53:30,955 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2022-01-18 22:53:30,956 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-01-18 22:53:30,956 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 332 flow [2022-01-18 22:53:30,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 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:53:30,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:30,957 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] [2022-01-18 22:53:30,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:53:30,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1859241053, now seen corresponding path program 1 times [2022-01-18 22:53:30,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282340678] [2022-01-18 22:53:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:30,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:31,206 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:53:31,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:31,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282340678] [2022-01-18 22:53:31,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282340678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:31,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:31,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-18 22:53:31,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140469760] [2022-01-18 22:53:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:31,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 22:53:31,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 22:53:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-18 22:53:31,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-18 22:53:31,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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:53:31,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:31,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-18 22:53:31,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:31,767 INFO L129 PetriNetUnfolder]: 545/1364 cut-off events. [2022-01-18 22:53:31,767 INFO L130 PetriNetUnfolder]: For 5430/5526 co-relation queries the response was YES. [2022-01-18 22:53:31,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 1364 events. 545/1364 cut-off events. For 5430/5526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8532 event pairs, 78 based on Foata normal form. 27/1262 useless extension candidates. Maximal degree in co-relation 5152. Up to 535 conditions per place. [2022-01-18 22:53:31,781 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 38 selfloop transitions, 20 changer transitions 25/157 dead transitions. [2022-01-18 22:53:31,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 157 transitions, 905 flow [2022-01-18 22:53:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 22:53:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-18 22:53:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1366 transitions. [2022-01-18 22:53:31,785 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7988304093567251 [2022-01-18 22:53:31,785 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1366 transitions. [2022-01-18 22:53:31,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1366 transitions. [2022-01-18 22:53:31,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:31,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1366 transitions. [2022-01-18 22:53:31,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 91.06666666666666) internal successors, (1366), 15 states have internal predecessors, (1366), 0 states have call successors, (0), 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:53:31,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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:53:31,791 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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:53:31,791 INFO L186 Difference]: Start difference. First operand has 134 places, 104 transitions, 332 flow. Second operand 15 states and 1366 transitions. [2022-01-18 22:53:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 157 transitions, 905 flow [2022-01-18 22:53:31,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 868 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-01-18 22:53:31,801 INFO L242 Difference]: Finished difference. Result has 144 places, 115 transitions, 476 flow [2022-01-18 22:53:31,801 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=476, PETRI_PLACES=144, PETRI_TRANSITIONS=115} [2022-01-18 22:53:31,802 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-01-18 22:53:31,802 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 476 flow [2022-01-18 22:53:31,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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:53:31,802 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:31,803 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] [2022-01-18 22:53:31,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:53:31,803 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 153497483, now seen corresponding path program 2 times [2022-01-18 22:53:31,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372739399] [2022-01-18 22:53:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:31,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:32,170 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:53:32,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:32,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372739399] [2022-01-18 22:53:32,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372739399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:32,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:32,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-18 22:53:32,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854617837] [2022-01-18 22:53:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:32,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 22:53:32,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 22:53:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-18 22:53:32,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-01-18 22:53:32,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 476 flow. Second operand has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 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:53:32,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:32,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-01-18 22:53:32,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:32,769 INFO L129 PetriNetUnfolder]: 563/1378 cut-off events. [2022-01-18 22:53:32,769 INFO L130 PetriNetUnfolder]: For 10183/10815 co-relation queries the response was YES. [2022-01-18 22:53:32,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 1378 events. 563/1378 cut-off events. For 10183/10815 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8493 event pairs, 80 based on Foata normal form. 52/1293 useless extension candidates. Maximal degree in co-relation 6586. Up to 548 conditions per place. [2022-01-18 22:53:32,780 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 32 selfloop transitions, 24 changer transitions 26/155 dead transitions. [2022-01-18 22:53:32,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 155 transitions, 1086 flow [2022-01-18 22:53:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:53:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:53:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1434 transitions. [2022-01-18 22:53:32,783 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7861842105263158 [2022-01-18 22:53:32,783 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1434 transitions. [2022-01-18 22:53:32,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1434 transitions. [2022-01-18 22:53:32,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:32,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1434 transitions. [2022-01-18 22:53:32,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 89.625) internal successors, (1434), 16 states have internal predecessors, (1434), 0 states have call successors, (0), 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:53:32,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 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:53:32,788 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 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:53:32,788 INFO L186 Difference]: Start difference. First operand has 144 places, 115 transitions, 476 flow. Second operand 16 states and 1434 transitions. [2022-01-18 22:53:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 155 transitions, 1086 flow [2022-01-18 22:53:32,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 155 transitions, 986 flow, removed 46 selfloop flow, removed 10 redundant places. [2022-01-18 22:53:32,799 INFO L242 Difference]: Finished difference. Result has 150 places, 117 transitions, 562 flow [2022-01-18 22:53:32,800 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=562, PETRI_PLACES=150, PETRI_TRANSITIONS=117} [2022-01-18 22:53:32,800 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-01-18 22:53:32,800 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 117 transitions, 562 flow [2022-01-18 22:53:32,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 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:53:32,801 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:32,801 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] [2022-01-18 22:53:32,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:53:32,801 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1585920861, now seen corresponding path program 3 times [2022-01-18 22:53:32,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:32,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371541186] [2022-01-18 22:53:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:32,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:33,033 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:53:33,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371541186] [2022-01-18 22:53:33,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371541186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:33,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:33,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 22:53:33,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395155581] [2022-01-18 22:53:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:33,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 22:53:33,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 22:53:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-18 22:53:33,035 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-01-18 22:53:33,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 117 transitions, 562 flow. Second operand has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 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:53:33,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:33,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-01-18 22:53:33,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:33,552 INFO L129 PetriNetUnfolder]: 529/1398 cut-off events. [2022-01-18 22:53:33,553 INFO L130 PetriNetUnfolder]: For 13087/14313 co-relation queries the response was YES. [2022-01-18 22:53:33,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 1398 events. 529/1398 cut-off events. For 13087/14313 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9446 event pairs, 125 based on Foata normal form. 46/1321 useless extension candidates. Maximal degree in co-relation 7206. Up to 532 conditions per place. [2022-01-18 22:53:33,562 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 39 selfloop transitions, 13 changer transitions 27/151 dead transitions. [2022-01-18 22:53:33,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 151 transitions, 1193 flow [2022-01-18 22:53:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:53:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:53:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions. [2022-01-18 22:53:33,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7800269905533064 [2022-01-18 22:53:33,565 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions. [2022-01-18 22:53:33,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions. [2022-01-18 22:53:33,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:33,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions. [2022-01-18 22:53:33,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.92307692307692) internal successors, (1156), 13 states have internal predecessors, (1156), 0 states have call successors, (0), 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:53:33,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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:53:33,569 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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:53:33,569 INFO L186 Difference]: Start difference. First operand has 150 places, 117 transitions, 562 flow. Second operand 13 states and 1156 transitions. [2022-01-18 22:53:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 151 transitions, 1193 flow [2022-01-18 22:53:33,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 151 transitions, 1021 flow, removed 76 selfloop flow, removed 13 redundant places. [2022-01-18 22:53:33,578 INFO L242 Difference]: Finished difference. Result has 150 places, 118 transitions, 589 flow [2022-01-18 22:53:33,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=589, PETRI_PLACES=150, PETRI_TRANSITIONS=118} [2022-01-18 22:53:33,579 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-01-18 22:53:33,579 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 589 flow [2022-01-18 22:53:33,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 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:53:33,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:33,580 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] [2022-01-18 22:53:33,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:53:33,580 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash -78862206, now seen corresponding path program 1 times [2022-01-18 22:53:33,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:33,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209433483] [2022-01-18 22:53:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:33,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:33,808 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:53:33,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209433483] [2022-01-18 22:53:33,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209433483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:33,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:33,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-18 22:53:33,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051083429] [2022-01-18 22:53:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:33,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 22:53:33,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 22:53:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-01-18 22:53:33,810 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-18 22:53:33,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 589 flow. Second operand has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 0 states have call successors, (0), 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:53:33,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:33,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-18 22:53:33,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:34,511 INFO L129 PetriNetUnfolder]: 536/1585 cut-off events. [2022-01-18 22:53:34,511 INFO L130 PetriNetUnfolder]: For 13063/14663 co-relation queries the response was YES. [2022-01-18 22:53:34,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 1585 events. 536/1585 cut-off events. For 13063/14663 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11961 event pairs, 57 based on Foata normal form. 111/1586 useless extension candidates. Maximal degree in co-relation 7669. Up to 536 conditions per place. [2022-01-18 22:53:34,524 INFO L132 encePairwiseOnDemand]: 97/114 looper letters, 35 selfloop transitions, 23 changer transitions 52/181 dead transitions. [2022-01-18 22:53:34,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 181 transitions, 1517 flow [2022-01-18 22:53:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 22:53:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-18 22:53:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1661 transitions. [2022-01-18 22:53:34,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7668513388734995 [2022-01-18 22:53:34,528 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1661 transitions. [2022-01-18 22:53:34,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1661 transitions. [2022-01-18 22:53:34,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:34,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1661 transitions. [2022-01-18 22:53:34,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 87.42105263157895) internal successors, (1661), 19 states have internal predecessors, (1661), 0 states have call successors, (0), 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:53:34,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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:53:34,534 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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:53:34,534 INFO L186 Difference]: Start difference. First operand has 150 places, 118 transitions, 589 flow. Second operand 19 states and 1661 transitions. [2022-01-18 22:53:34,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 181 transitions, 1517 flow [2022-01-18 22:53:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 181 transitions, 1398 flow, removed 52 selfloop flow, removed 10 redundant places. [2022-01-18 22:53:34,549 INFO L242 Difference]: Finished difference. Result has 163 places, 124 transitions, 740 flow [2022-01-18 22:53:34,549 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=740, PETRI_PLACES=163, PETRI_TRANSITIONS=124} [2022-01-18 22:53:34,550 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2022-01-18 22:53:34,550 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 124 transitions, 740 flow [2022-01-18 22:53:34,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 0 states have call successors, (0), 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:53:34,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:34,551 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] [2022-01-18 22:53:34,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:53:34,551 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash 529644052, now seen corresponding path program 2 times [2022-01-18 22:53:34,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:34,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465592846] [2022-01-18 22:53:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:34,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:34,703 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:53:34,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465592846] [2022-01-18 22:53:34,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465592846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:34,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:34,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:53:34,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214308532] [2022-01-18 22:53:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:34,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:53:34,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:53:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:53:34,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-18 22:53:34,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 124 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 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:53:34,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:34,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-18 22:53:34,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:35,157 INFO L129 PetriNetUnfolder]: 481/1417 cut-off events. [2022-01-18 22:53:35,157 INFO L130 PetriNetUnfolder]: For 15430/17838 co-relation queries the response was YES. [2022-01-18 22:53:35,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1417 events. 481/1417 cut-off events. For 15430/17838 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10262 event pairs, 102 based on Foata normal form. 85/1388 useless extension candidates. Maximal degree in co-relation 8250. Up to 625 conditions per place. [2022-01-18 22:53:35,168 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 53 selfloop transitions, 29 changer transitions 20/173 dead transitions. [2022-01-18 22:53:35,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 173 transitions, 1713 flow [2022-01-18 22:53:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:53:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:53:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions. [2022-01-18 22:53:35,170 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.773524720893142 [2022-01-18 22:53:35,170 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 970 transitions. [2022-01-18 22:53:35,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions. [2022-01-18 22:53:35,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:35,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions. [2022-01-18 22:53:35,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 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:53:35,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:35,173 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:35,173 INFO L186 Difference]: Start difference. First operand has 163 places, 124 transitions, 740 flow. Second operand 11 states and 970 transitions. [2022-01-18 22:53:35,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 173 transitions, 1713 flow [2022-01-18 22:53:35,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 1499 flow, removed 87 selfloop flow, removed 14 redundant places. [2022-01-18 22:53:35,191 INFO L242 Difference]: Finished difference. Result has 155 places, 143 transitions, 1035 flow [2022-01-18 22:53:35,192 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1035, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2022-01-18 22:53:35,194 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-01-18 22:53:35,194 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1035 flow [2022-01-18 22:53:35,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 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:53:35,194 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:35,194 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] [2022-01-18 22:53:35,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:53:35,195 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1019708772, now seen corresponding path program 3 times [2022-01-18 22:53:35,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:35,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089408286] [2022-01-18 22:53:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:35,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:35,471 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:53:35,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:35,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089408286] [2022-01-18 22:53:35,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089408286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:35,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:35,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-18 22:53:35,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573133373] [2022-01-18 22:53:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:35,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 22:53:35,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 22:53:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-18 22:53:35,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-01-18 22:53:35,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1035 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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:53:35,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:35,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-01-18 22:53:35,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:36,071 INFO L129 PetriNetUnfolder]: 471/1418 cut-off events. [2022-01-18 22:53:36,071 INFO L130 PetriNetUnfolder]: For 12982/16946 co-relation queries the response was YES. [2022-01-18 22:53:36,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1418 events. 471/1418 cut-off events. For 12982/16946 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10249 event pairs, 87 based on Foata normal form. 98/1394 useless extension candidates. Maximal degree in co-relation 7910. Up to 562 conditions per place. [2022-01-18 22:53:36,091 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 50 selfloop transitions, 29 changer transitions 33/182 dead transitions. [2022-01-18 22:53:36,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 1745 flow [2022-01-18 22:53:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-18 22:53:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-18 22:53:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1548 transitions. [2022-01-18 22:53:36,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2022-01-18 22:53:36,095 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1548 transitions. [2022-01-18 22:53:36,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1548 transitions. [2022-01-18 22:53:36,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:36,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1548 transitions. [2022-01-18 22:53:36,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 0 states have call successors, (0), 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:53:36,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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:53:36,102 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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:53:36,103 INFO L186 Difference]: Start difference. First operand has 155 places, 143 transitions, 1035 flow. Second operand 18 states and 1548 transitions. [2022-01-18 22:53:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 1745 flow [2022-01-18 22:53:36,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 182 transitions, 1692 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-01-18 22:53:36,116 INFO L242 Difference]: Finished difference. Result has 170 places, 140 transitions, 1032 flow [2022-01-18 22:53:36,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1032, PETRI_PLACES=170, PETRI_TRANSITIONS=140} [2022-01-18 22:53:36,117 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2022-01-18 22:53:36,117 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 140 transitions, 1032 flow [2022-01-18 22:53:36,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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:53:36,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:36,123 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] [2022-01-18 22:53:36,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:53:36,124 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1125697522, now seen corresponding path program 4 times [2022-01-18 22:53:36,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:36,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997990069] [2022-01-18 22:53:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:36,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:36,285 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:53:36,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997990069] [2022-01-18 22:53:36,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997990069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:36,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:36,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:53:36,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266925651] [2022-01-18 22:53:36,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:36,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:53:36,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:53:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:53:36,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-18 22:53:36,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 140 transitions, 1032 flow. Second operand has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 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:53:36,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:36,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-18 22:53:36,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:36,774 INFO L129 PetriNetUnfolder]: 450/1402 cut-off events. [2022-01-18 22:53:36,774 INFO L130 PetriNetUnfolder]: For 15629/21494 co-relation queries the response was YES. [2022-01-18 22:53:36,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 1402 events. 450/1402 cut-off events. For 15629/21494 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10291 event pairs, 67 based on Foata normal form. 62/1358 useless extension candidates. Maximal degree in co-relation 8052. Up to 554 conditions per place. [2022-01-18 22:53:36,783 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 56 selfloop transitions, 22 changer transitions 21/173 dead transitions. [2022-01-18 22:53:36,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 1728 flow [2022-01-18 22:53:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:53:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:53:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1086 transitions. [2022-01-18 22:53:36,785 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.793859649122807 [2022-01-18 22:53:36,785 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1086 transitions. [2022-01-18 22:53:36,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1086 transitions. [2022-01-18 22:53:36,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:36,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1086 transitions. [2022-01-18 22:53:36,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 0 states have call successors, (0), 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:53:36,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:36,787 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:36,788 INFO L186 Difference]: Start difference. First operand has 170 places, 140 transitions, 1032 flow. Second operand 12 states and 1086 transitions. [2022-01-18 22:53:36,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 1728 flow [2022-01-18 22:53:36,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 173 transitions, 1586 flow, removed 41 selfloop flow, removed 17 redundant places. [2022-01-18 22:53:36,805 INFO L242 Difference]: Finished difference. Result has 163 places, 146 transitions, 1156 flow [2022-01-18 22:53:36,806 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1156, PETRI_PLACES=163, PETRI_TRANSITIONS=146} [2022-01-18 22:53:36,806 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2022-01-18 22:53:36,806 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 146 transitions, 1156 flow [2022-01-18 22:53:36,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 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:53:36,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:36,806 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] [2022-01-18 22:53:36,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 22:53:36,807 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2046886782, now seen corresponding path program 5 times [2022-01-18 22:53:36,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:36,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606273481] [2022-01-18 22:53:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:36,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:37,075 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:53:37,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:37,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606273481] [2022-01-18 22:53:37,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606273481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:37,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:37,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-18 22:53:37,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754139249] [2022-01-18 22:53:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:37,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 22:53:37,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 22:53:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-18 22:53:37,077 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-01-18 22:53:37,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 146 transitions, 1156 flow. Second operand has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 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:53:37,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:37,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-01-18 22:53:37,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:37,645 INFO L129 PetriNetUnfolder]: 404/1355 cut-off events. [2022-01-18 22:53:37,645 INFO L130 PetriNetUnfolder]: For 14404/21448 co-relation queries the response was YES. [2022-01-18 22:53:37,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1355 events. 404/1355 cut-off events. For 14404/21448 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10735 event pairs, 73 based on Foata normal form. 76/1328 useless extension candidates. Maximal degree in co-relation 7754. Up to 421 conditions per place. [2022-01-18 22:53:37,655 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 55 selfloop transitions, 19 changer transitions 42/184 dead transitions. [2022-01-18 22:53:37,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 184 transitions, 1899 flow [2022-01-18 22:53:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-18 22:53:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-18 22:53:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1429 transitions. [2022-01-18 22:53:37,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.737358101135191 [2022-01-18 22:53:37,657 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1429 transitions. [2022-01-18 22:53:37,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1429 transitions. [2022-01-18 22:53:37,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:37,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1429 transitions. [2022-01-18 22:53:37,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.05882352941177) internal successors, (1429), 17 states have internal predecessors, (1429), 0 states have call successors, (0), 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:53:37,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 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:53:37,661 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 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:53:37,661 INFO L186 Difference]: Start difference. First operand has 163 places, 146 transitions, 1156 flow. Second operand 17 states and 1429 transitions. [2022-01-18 22:53:37,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 184 transitions, 1899 flow [2022-01-18 22:53:37,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 184 transitions, 1800 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-01-18 22:53:37,679 INFO L242 Difference]: Finished difference. Result has 171 places, 135 transitions, 962 flow [2022-01-18 22:53:37,679 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=962, PETRI_PLACES=171, PETRI_TRANSITIONS=135} [2022-01-18 22:53:37,679 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2022-01-18 22:53:37,679 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 135 transitions, 962 flow [2022-01-18 22:53:37,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 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:53:37,680 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:37,680 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] [2022-01-18 22:53:37,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 22:53:37,680 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1955626832, now seen corresponding path program 1 times [2022-01-18 22:53:37,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:37,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903498865] [2022-01-18 22:53:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:37,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:37,746 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:53:37,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:37,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903498865] [2022-01-18 22:53:37,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903498865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:37,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:37,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:53:37,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399023045] [2022-01-18 22:53:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:37,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:53:37,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:37,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:53:37,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:53:37,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-01-18 22:53:37,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 135 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 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:53:37,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:37,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-01-18 22:53:37,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:38,604 INFO L129 PetriNetUnfolder]: 3251/6195 cut-off events. [2022-01-18 22:53:38,605 INFO L130 PetriNetUnfolder]: For 57011/57286 co-relation queries the response was YES. [2022-01-18 22:53:38,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29199 conditions, 6195 events. 3251/6195 cut-off events. For 57011/57286 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47458 event pairs, 102 based on Foata normal form. 150/6126 useless extension candidates. Maximal degree in co-relation 29107. Up to 1875 conditions per place. [2022-01-18 22:53:38,641 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 74 selfloop transitions, 6 changer transitions 158/314 dead transitions. [2022-01-18 22:53:38,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 314 transitions, 3697 flow [2022-01-18 22:53:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:53:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:53:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2022-01-18 22:53:38,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8578947368421053 [2022-01-18 22:53:38,643 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 978 transitions. [2022-01-18 22:53:38,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions. [2022-01-18 22:53:38,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:38,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions. [2022-01-18 22:53:38,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 0 states have call successors, (0), 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:53:38,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:38,696 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:38,696 INFO L186 Difference]: Start difference. First operand has 171 places, 135 transitions, 962 flow. Second operand 10 states and 978 transitions. [2022-01-18 22:53:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 314 transitions, 3697 flow [2022-01-18 22:53:38,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 314 transitions, 3462 flow, removed 39 selfloop flow, removed 20 redundant places. [2022-01-18 22:53:38,718 INFO L242 Difference]: Finished difference. Result has 158 places, 128 transitions, 787 flow [2022-01-18 22:53:38,718 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=787, PETRI_PLACES=158, PETRI_TRANSITIONS=128} [2022-01-18 22:53:38,718 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2022-01-18 22:53:38,718 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 128 transitions, 787 flow [2022-01-18 22:53:38,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 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:53:38,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:38,719 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:38,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 22:53:38,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1706371020, now seen corresponding path program 1 times [2022-01-18 22:53:38,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:38,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011080700] [2022-01-18 22:53:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:38,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:38,795 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:53:38,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:38,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011080700] [2022-01-18 22:53:38,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011080700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:38,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:38,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:53:38,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841057940] [2022-01-18 22:53:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:38,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:53:38,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:53:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:53:38,797 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-01-18 22:53:38,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 128 transitions, 787 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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:53:38,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:38,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-01-18 22:53:38,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:39,267 INFO L129 PetriNetUnfolder]: 1090/2610 cut-off events. [2022-01-18 22:53:39,267 INFO L130 PetriNetUnfolder]: For 20824/20913 co-relation queries the response was YES. [2022-01-18 22:53:39,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12863 conditions, 2610 events. 1090/2610 cut-off events. For 20824/20913 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19592 event pairs, 21 based on Foata normal form. 132/2713 useless extension candidates. Maximal degree in co-relation 12780. Up to 663 conditions per place. [2022-01-18 22:53:39,283 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 59 selfloop transitions, 9 changer transitions 112/256 dead transitions. [2022-01-18 22:53:39,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 256 transitions, 2845 flow [2022-01-18 22:53:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:53:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:53:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2022-01-18 22:53:39,285 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2022-01-18 22:53:39,285 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2022-01-18 22:53:39,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2022-01-18 22:53:39,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:39,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2022-01-18 22:53:39,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 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:53:39,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:39,288 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:39,288 INFO L186 Difference]: Start difference. First operand has 158 places, 128 transitions, 787 flow. Second operand 10 states and 976 transitions. [2022-01-18 22:53:39,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 256 transitions, 2845 flow [2022-01-18 22:53:39,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 256 transitions, 2760 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-01-18 22:53:39,306 INFO L242 Difference]: Finished difference. Result has 161 places, 120 transitions, 692 flow [2022-01-18 22:53:39,306 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=161, PETRI_TRANSITIONS=120} [2022-01-18 22:53:39,306 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2022-01-18 22:53:39,307 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 692 flow [2022-01-18 22:53:39,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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:53:39,307 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:39,307 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:39,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 22:53:39,307 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1896302775, now seen corresponding path program 1 times [2022-01-18 22:53:39,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005623822] [2022-01-18 22:53:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:39,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:39,479 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:53:39,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:39,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005623822] [2022-01-18 22:53:39,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005623822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:39,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:39,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:53:39,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025396356] [2022-01-18 22:53:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:39,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:53:39,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:39,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:53:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:53:39,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-18 22:53:39,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 120 transitions, 692 flow. Second operand has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 0 states have call successors, (0), 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:53:39,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:39,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-18 22:53:39,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:39,871 INFO L129 PetriNetUnfolder]: 221/1170 cut-off events. [2022-01-18 22:53:39,872 INFO L130 PetriNetUnfolder]: For 5726/5974 co-relation queries the response was YES. [2022-01-18 22:53:39,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 1170 events. 221/1170 cut-off events. For 5726/5974 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9242 event pairs, 43 based on Foata normal form. 56/1192 useless extension candidates. Maximal degree in co-relation 4636. Up to 274 conditions per place. [2022-01-18 22:53:39,879 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 44 selfloop transitions, 17 changer transitions 12/149 dead transitions. [2022-01-18 22:53:39,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 149 transitions, 1082 flow [2022-01-18 22:53:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:53:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:53:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1141 transitions. [2022-01-18 22:53:39,881 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7699055330634278 [2022-01-18 22:53:39,881 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1141 transitions. [2022-01-18 22:53:39,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1141 transitions. [2022-01-18 22:53:39,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:39,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1141 transitions. [2022-01-18 22:53:39,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.76923076923077) internal successors, (1141), 13 states have internal predecessors, (1141), 0 states have call successors, (0), 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:53:39,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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:53:39,884 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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:53:39,884 INFO L186 Difference]: Start difference. First operand has 161 places, 120 transitions, 692 flow. Second operand 13 states and 1141 transitions. [2022-01-18 22:53:39,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 149 transitions, 1082 flow [2022-01-18 22:53:39,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 968 flow, removed 36 selfloop flow, removed 15 redundant places. [2022-01-18 22:53:39,896 INFO L242 Difference]: Finished difference. Result has 162 places, 125 transitions, 725 flow [2022-01-18 22:53:39,897 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=725, PETRI_PLACES=162, PETRI_TRANSITIONS=125} [2022-01-18 22:53:39,897 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2022-01-18 22:53:39,897 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 725 flow [2022-01-18 22:53:39,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 0 states have call successors, (0), 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:53:39,897 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:39,897 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:39,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 22:53:39,898 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash -167958605, now seen corresponding path program 2 times [2022-01-18 22:53:39,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:39,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186725973] [2022-01-18 22:53:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:39,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:40,029 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:53:40,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:40,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186725973] [2022-01-18 22:53:40,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186725973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:40,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:40,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:53:40,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333800912] [2022-01-18 22:53:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:40,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:53:40,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:53:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:53:40,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-18 22:53:40,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 125 transitions, 725 flow. Second operand has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 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:53:40,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:40,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-18 22:53:40,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:40,358 INFO L129 PetriNetUnfolder]: 245/1356 cut-off events. [2022-01-18 22:53:40,359 INFO L130 PetriNetUnfolder]: For 5225/5401 co-relation queries the response was YES. [2022-01-18 22:53:40,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 1356 events. 245/1356 cut-off events. For 5225/5401 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11392 event pairs, 40 based on Foata normal form. 48/1366 useless extension candidates. Maximal degree in co-relation 4420. Up to 278 conditions per place. [2022-01-18 22:53:40,366 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 43 selfloop transitions, 11 changer transitions 12/145 dead transitions. [2022-01-18 22:53:40,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 1053 flow [2022-01-18 22:53:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:53:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:53:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1080 transitions. [2022-01-18 22:53:40,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7894736842105263 [2022-01-18 22:53:40,368 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1080 transitions. [2022-01-18 22:53:40,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1080 transitions. [2022-01-18 22:53:40,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:40,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1080 transitions. [2022-01-18 22:53:40,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.0) internal successors, (1080), 12 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:53:40,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:40,370 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:40,370 INFO L186 Difference]: Start difference. First operand has 162 places, 125 transitions, 725 flow. Second operand 12 states and 1080 transitions. [2022-01-18 22:53:40,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 145 transitions, 1053 flow [2022-01-18 22:53:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 145 transitions, 988 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-01-18 22:53:40,378 INFO L242 Difference]: Finished difference. Result has 165 places, 127 transitions, 764 flow [2022-01-18 22:53:40,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=764, PETRI_PLACES=165, PETRI_TRANSITIONS=127} [2022-01-18 22:53:40,379 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2022-01-18 22:53:40,379 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 127 transitions, 764 flow [2022-01-18 22:53:40,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 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:53:40,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:40,379 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:40,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 22:53:40,379 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:40,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash 435034293, now seen corresponding path program 3 times [2022-01-18 22:53:40,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720674110] [2022-01-18 22:53:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:40,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:40,479 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:53:40,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:40,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720674110] [2022-01-18 22:53:40,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720674110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:40,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:40,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:53:40,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855282959] [2022-01-18 22:53:40,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:40,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:53:40,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:53:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:53:40,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-01-18 22:53:40,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 127 transitions, 764 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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:53:40,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:40,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-01-18 22:53:40,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:40,781 INFO L129 PetriNetUnfolder]: 374/1368 cut-off events. [2022-01-18 22:53:40,781 INFO L130 PetriNetUnfolder]: For 11046/11173 co-relation queries the response was YES. [2022-01-18 22:53:40,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1368 events. 374/1368 cut-off events. For 11046/11173 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10896 event pairs, 3 based on Foata normal form. 72/1431 useless extension candidates. Maximal degree in co-relation 5802. Up to 287 conditions per place. [2022-01-18 22:53:40,787 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 50 selfloop transitions, 12 changer transitions 46/185 dead transitions. [2022-01-18 22:53:40,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 185 transitions, 1841 flow [2022-01-18 22:53:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:53:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:53:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1032 transitions. [2022-01-18 22:53:40,789 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8229665071770335 [2022-01-18 22:53:40,789 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1032 transitions. [2022-01-18 22:53:40,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1032 transitions. [2022-01-18 22:53:40,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:40,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1032 transitions. [2022-01-18 22:53:40,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.81818181818181) internal successors, (1032), 11 states have internal predecessors, (1032), 0 states have call successors, (0), 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:53:40,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:40,792 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:40,792 INFO L186 Difference]: Start difference. First operand has 165 places, 127 transitions, 764 flow. Second operand 11 states and 1032 transitions. [2022-01-18 22:53:40,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 185 transitions, 1841 flow [2022-01-18 22:53:40,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 1490 flow, removed 140 selfloop flow, removed 15 redundant places. [2022-01-18 22:53:40,803 INFO L242 Difference]: Finished difference. Result has 160 places, 123 transitions, 641 flow [2022-01-18 22:53:40,803 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=641, PETRI_PLACES=160, PETRI_TRANSITIONS=123} [2022-01-18 22:53:40,803 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2022-01-18 22:53:40,803 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 123 transitions, 641 flow [2022-01-18 22:53:40,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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:53:40,804 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:40,804 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:40,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 22:53:40,804 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1412627892, now seen corresponding path program 1 times [2022-01-18 22:53:40,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35670098] [2022-01-18 22:53:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:40,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:41,052 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:53:41,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35670098] [2022-01-18 22:53:41,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35670098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:41,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:41,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-18 22:53:41,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203245486] [2022-01-18 22:53:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:41,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-18 22:53:41,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-18 22:53:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-18 22:53:41,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-01-18 22:53:41,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 123 transitions, 641 flow. Second operand has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 0 states have call successors, (0), 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:53:41,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:41,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-01-18 22:53:41,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:41,321 INFO L129 PetriNetUnfolder]: 95/674 cut-off events. [2022-01-18 22:53:41,321 INFO L130 PetriNetUnfolder]: For 2077/2192 co-relation queries the response was YES. [2022-01-18 22:53:41,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 674 events. 95/674 cut-off events. For 2077/2192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5018 event pairs, 2 based on Foata normal form. 18/675 useless extension candidates. Maximal degree in co-relation 2105. Up to 133 conditions per place. [2022-01-18 22:53:41,324 INFO L132 encePairwiseOnDemand]: 97/114 looper letters, 32 selfloop transitions, 13 changer transitions 13/133 dead transitions. [2022-01-18 22:53:41,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 133 transitions, 809 flow [2022-01-18 22:53:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 22:53:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-18 22:53:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1275 transitions. [2022-01-18 22:53:41,326 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2022-01-18 22:53:41,326 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1275 transitions. [2022-01-18 22:53:41,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1275 transitions. [2022-01-18 22:53:41,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:41,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1275 transitions. [2022-01-18 22:53:41,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 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:53:41,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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:53:41,329 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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:53:41,329 INFO L186 Difference]: Start difference. First operand has 160 places, 123 transitions, 641 flow. Second operand 15 states and 1275 transitions. [2022-01-18 22:53:41,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 133 transitions, 809 flow [2022-01-18 22:53:41,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 133 transitions, 685 flow, removed 43 selfloop flow, removed 18 redundant places. [2022-01-18 22:53:41,336 INFO L242 Difference]: Finished difference. Result has 158 places, 119 transitions, 522 flow [2022-01-18 22:53:41,336 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=522, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2022-01-18 22:53:41,336 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2022-01-18 22:53:41,336 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 522 flow [2022-01-18 22:53:41,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 0 states have call successors, (0), 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:53:41,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:41,337 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:41,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-18 22:53:41,337 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash -531343430, now seen corresponding path program 2 times [2022-01-18 22:53:41,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025789851] [2022-01-18 22:53:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:41,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:41,506 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:53:41,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:41,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025789851] [2022-01-18 22:53:41,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025789851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:41,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:41,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:53:41,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150291380] [2022-01-18 22:53:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:41,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:53:41,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:53:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:53:41,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-18 22:53:41,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 522 flow. Second operand has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 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:53:41,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:41,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-18 22:53:41,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:41,759 INFO L129 PetriNetUnfolder]: 93/662 cut-off events. [2022-01-18 22:53:41,759 INFO L130 PetriNetUnfolder]: For 841/890 co-relation queries the response was YES. [2022-01-18 22:53:41,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 662 events. 93/662 cut-off events. For 841/890 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4847 event pairs, 2 based on Foata normal form. 9/654 useless extension candidates. Maximal degree in co-relation 1475. Up to 92 conditions per place. [2022-01-18 22:53:41,761 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 29 selfloop transitions, 15 changer transitions 13/132 dead transitions. [2022-01-18 22:53:41,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 132 transitions, 736 flow [2022-01-18 22:53:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:53:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:53:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 957 transitions. [2022-01-18 22:53:41,763 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7631578947368421 [2022-01-18 22:53:41,763 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 957 transitions. [2022-01-18 22:53:41,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 957 transitions. [2022-01-18 22:53:41,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:41,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 957 transitions. [2022-01-18 22:53:41,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 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:53:41,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:41,765 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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:53:41,765 INFO L186 Difference]: Start difference. First operand has 158 places, 119 transitions, 522 flow. Second operand 11 states and 957 transitions. [2022-01-18 22:53:41,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 132 transitions, 736 flow [2022-01-18 22:53:41,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 132 transitions, 662 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-01-18 22:53:41,769 INFO L242 Difference]: Finished difference. Result has 151 places, 119 transitions, 523 flow [2022-01-18 22:53:41,769 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=523, PETRI_PLACES=151, PETRI_TRANSITIONS=119} [2022-01-18 22:53:41,769 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-01-18 22:53:41,769 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 523 flow [2022-01-18 22:53:41,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 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:53:41,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:41,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] [2022-01-18 22:53:41,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-18 22:53:41,770 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash -870122366, now seen corresponding path program 3 times [2022-01-18 22:53:41,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:41,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875992610] [2022-01-18 22:53:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:41,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:41,881 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:53:41,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875992610] [2022-01-18 22:53:41,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875992610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:41,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:41,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:53:41,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960067250] [2022-01-18 22:53:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:41,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:53:41,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:53:41,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:53:41,883 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-01-18 22:53:41,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 523 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 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:53:41,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:41,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-01-18 22:53:41,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:42,049 INFO L129 PetriNetUnfolder]: 45/393 cut-off events. [2022-01-18 22:53:42,049 INFO L130 PetriNetUnfolder]: For 546/559 co-relation queries the response was YES. [2022-01-18 22:53:42,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 393 events. 45/393 cut-off events. For 546/559 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2146 event pairs, 2 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 881. Up to 65 conditions per place. [2022-01-18 22:53:42,051 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 30 selfloop transitions, 9 changer transitions 14/132 dead transitions. [2022-01-18 22:53:42,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 132 transitions, 743 flow [2022-01-18 22:53:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:53:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:53:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 820 transitions. [2022-01-18 22:53:42,060 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7992202729044834 [2022-01-18 22:53:42,060 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 820 transitions. [2022-01-18 22:53:42,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 820 transitions. [2022-01-18 22:53:42,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:42,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 820 transitions. [2022-01-18 22:53:42,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 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:53:42,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:42,077 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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:53:42,077 INFO L186 Difference]: Start difference. First operand has 151 places, 119 transitions, 523 flow. Second operand 9 states and 820 transitions. [2022-01-18 22:53:42,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 132 transitions, 743 flow [2022-01-18 22:53:42,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 681 flow, removed 18 selfloop flow, removed 11 redundant places. [2022-01-18 22:53:42,080 INFO L242 Difference]: Finished difference. Result has 149 places, 118 transitions, 499 flow [2022-01-18 22:53:42,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=149, PETRI_TRANSITIONS=118} [2022-01-18 22:53:42,081 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-01-18 22:53:42,081 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 118 transitions, 499 flow [2022-01-18 22:53:42,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 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:53:42,081 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:42,081 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:42,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 22:53:42,082 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1328193492, now seen corresponding path program 4 times [2022-01-18 22:53:42,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:42,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704577157] [2022-01-18 22:53:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:42,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:42,247 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:53:42,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704577157] [2022-01-18 22:53:42,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704577157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:42,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:42,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:53:42,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4240016] [2022-01-18 22:53:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:42,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:53:42,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:53:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:53:42,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-01-18 22:53:42,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 118 transitions, 499 flow. Second operand has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 0 states have call successors, (0), 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:53:42,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:42,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-01-18 22:53:42,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:42,444 INFO L129 PetriNetUnfolder]: 39/368 cut-off events. [2022-01-18 22:53:42,444 INFO L130 PetriNetUnfolder]: For 414/425 co-relation queries the response was YES. [2022-01-18 22:53:42,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 368 events. 39/368 cut-off events. For 414/425 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1953 event pairs, 0 based on Foata normal form. 8/371 useless extension candidates. Maximal degree in co-relation 783. Up to 44 conditions per place. [2022-01-18 22:53:42,446 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 25 selfloop transitions, 10 changer transitions 20/131 dead transitions. [2022-01-18 22:53:42,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 131 transitions, 708 flow [2022-01-18 22:53:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:53:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:53:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1065 transitions. [2022-01-18 22:53:42,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7785087719298246 [2022-01-18 22:53:42,447 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1065 transitions. [2022-01-18 22:53:42,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1065 transitions. [2022-01-18 22:53:42,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:42,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1065 transitions. [2022-01-18 22:53:42,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 0 states have call successors, (0), 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:53:42,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:42,450 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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:53:42,450 INFO L186 Difference]: Start difference. First operand has 149 places, 118 transitions, 499 flow. Second operand 12 states and 1065 transitions. [2022-01-18 22:53:42,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 131 transitions, 708 flow [2022-01-18 22:53:42,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 131 transitions, 618 flow, removed 24 selfloop flow, removed 11 redundant places. [2022-01-18 22:53:42,453 INFO L242 Difference]: Finished difference. Result has 149 places, 111 transitions, 414 flow [2022-01-18 22:53:42,453 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=414, PETRI_PLACES=149, PETRI_TRANSITIONS=111} [2022-01-18 22:53:42,453 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-01-18 22:53:42,454 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 111 transitions, 414 flow [2022-01-18 22:53:42,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 0 states have call successors, (0), 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:53:42,454 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:42,454 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:42,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-18 22:53:42,454 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1544419612, now seen corresponding path program 5 times [2022-01-18 22:53:42,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:42,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270638749] [2022-01-18 22:53:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:42,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:53:42,594 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:53:42,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:53:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270638749] [2022-01-18 22:53:42,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270638749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:53:42,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:53:42,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:53:42,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255432904] [2022-01-18 22:53:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:53:42,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:53:42,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:53:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:53:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:53:42,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-01-18 22:53:42,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 111 transitions, 414 flow. Second operand has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 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:53:42,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:53:42,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-01-18 22:53:42,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:53:42,781 INFO L129 PetriNetUnfolder]: 29/287 cut-off events. [2022-01-18 22:53:42,781 INFO L130 PetriNetUnfolder]: For 154/157 co-relation queries the response was YES. [2022-01-18 22:53:42,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 287 events. 29/287 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1255 event pairs, 0 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 554. Up to 34 conditions per place. [2022-01-18 22:53:42,782 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 23 selfloop transitions, 3 changer transitions 21/123 dead transitions. [2022-01-18 22:53:42,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 123 transitions, 598 flow [2022-01-18 22:53:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:53:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:53:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 891 transitions. [2022-01-18 22:53:42,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.781578947368421 [2022-01-18 22:53:42,784 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 891 transitions. [2022-01-18 22:53:42,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 891 transitions. [2022-01-18 22:53:42,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:53:42,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 891 transitions. [2022-01-18 22:53:42,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 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:53:42,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:42,786 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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:53:42,786 INFO L186 Difference]: Start difference. First operand has 149 places, 111 transitions, 414 flow. Second operand 10 states and 891 transitions. [2022-01-18 22:53:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 123 transitions, 598 flow [2022-01-18 22:53:42,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 524 flow, removed 15 selfloop flow, removed 15 redundant places. [2022-01-18 22:53:42,788 INFO L242 Difference]: Finished difference. Result has 138 places, 102 transitions, 302 flow [2022-01-18 22:53:42,789 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=138, PETRI_TRANSITIONS=102} [2022-01-18 22:53:42,789 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-01-18 22:53:42,789 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 302 flow [2022-01-18 22:53:42,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 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:53:42,789 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:53:42,789 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:42,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-18 22:53:42,790 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:53:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:53:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash -227522288, now seen corresponding path program 6 times [2022-01-18 22:53:42,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:53:42,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466716749] [2022-01-18 22:53:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:53:42,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:53:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:53:42,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:53:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:53:42,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:53:42,898 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:53:42,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:53:42,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:53:42,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:53:42,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:53:42,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:53:42,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:53:42,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-18 22:53:42,903 INFO L732 BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:53:42,906 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:53:42,906 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:53:42,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:53:42 BasicIcfg [2022-01-18 22:53:42,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:53:42,980 INFO L158 Benchmark]: Toolchain (without parser) took 17240.90ms. Allocated memory was 379.6MB in the beginning and 937.4MB in the end (delta: 557.8MB). Free memory was 320.1MB in the beginning and 501.9MB in the end (delta: -181.9MB). Peak memory consumption was 377.6MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,980 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 379.6MB. Free memory is still 338.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:53:42,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.46ms. Allocated memory was 379.6MB in the beginning and 547.4MB in the end (delta: 167.8MB). Free memory was 319.9MB in the beginning and 501.9MB in the end (delta: -182.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.87ms. Allocated memory is still 547.4MB. Free memory was 501.9MB in the beginning and 498.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,980 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 547.4MB. Free memory was 498.8MB in the beginning and 495.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,980 INFO L158 Benchmark]: RCFGBuilder took 1280.28ms. Allocated memory is still 547.4MB. Free memory was 495.6MB in the beginning and 343.6MB in the end (delta: 152.0MB). Peak memory consumption was 153.1MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,981 INFO L158 Benchmark]: TraceAbstraction took 15338.76ms. Allocated memory was 547.4MB in the beginning and 937.4MB in the end (delta: 390.1MB). Free memory was 342.5MB in the beginning and 501.9MB in the end (delta: -159.4MB). Peak memory consumption was 232.8MB. Max. memory is 16.0GB. [2022-01-18 22:53:42,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 379.6MB. Free memory is still 338.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 520.46ms. Allocated memory was 379.6MB in the beginning and 547.4MB in the end (delta: 167.8MB). Free memory was 319.9MB in the beginning and 501.9MB in the end (delta: -182.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.87ms. Allocated memory is still 547.4MB. Free memory was 501.9MB in the beginning and 498.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 547.4MB. Free memory was 498.8MB in the beginning and 495.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1280.28ms. Allocated memory is still 547.4MB. Free memory was 495.6MB in the beginning and 343.6MB in the end (delta: 152.0MB). Peak memory consumption was 153.1MB. Max. memory is 16.0GB. * TraceAbstraction took 15338.76ms. Allocated memory was 547.4MB in the beginning and 937.4MB in the end (delta: 390.1MB). Free memory was 342.5MB in the beginning and 501.9MB in the end (delta: -159.4MB). Peak memory consumption was 232.8MB. 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: 19]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1075 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1075 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4213 IncrementalHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 245 mSDtfsCounter, 4213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=12, InterpolantAutomatonStates: 282, 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.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 11795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:53:43,019 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...