/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 05:01:09,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 05:01:09,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 05:01:09,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 05:01:09,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 05:01:09,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 05:01:09,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 05:01:09,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 05:01:09,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 05:01:09,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 05:01:09,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 05:01:09,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 05:01:09,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 05:01:09,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 05:01:09,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 05:01:09,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 05:01:09,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 05:01:09,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 05:01:09,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 05:01:09,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 05:01:09,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 05:01:09,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 05:01:09,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 05:01:09,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 05:01:09,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 05:01:09,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 05:01:09,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 05:01:09,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 05:01:09,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 05:01:09,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 05:01:09,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 05:01:09,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 05:01:09,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 05:01:09,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 05:01:09,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 05:01:09,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 05:01:09,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 05:01:09,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 05:01:09,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 05:01:09,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 05:01:09,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 05:01:09,388 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-Before.epf [2022-01-19 05:01:09,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 05:01:09,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 05:01:09,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 05:01:09,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 05:01:09,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 05:01:09,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 05:01:09,411 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 05:01:09,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 05:01:09,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 05:01:09,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 05:01:09,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 05:01:09,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:01:09,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 05:01:09,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 05:01:09,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 05:01:09,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 05:01:09,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 05:01:09,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 05:01:09,414 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 05:01:09,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 05:01:09,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 05:01:09,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 05:01:09,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 05:01:09,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 05:01:09,617 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 05:01:09,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:09,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275dfc6b9/84cc44b5717c435db439646df41939d1/FLAGf4ffa8f5c [2022-01-19 05:01:10,111 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 05:01:10,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:10,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275dfc6b9/84cc44b5717c435db439646df41939d1/FLAGf4ffa8f5c [2022-01-19 05:01:10,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275dfc6b9/84cc44b5717c435db439646df41939d1 [2022-01-19 05:01:10,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 05:01:10,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 05:01:10,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 05:01:10,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 05:01:10,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 05:01:10,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519d6724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10, skipping insertion in model container [2022-01-19 05:01:10,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 05:01:10,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 05:01:10,376 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-19 05:01:10,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:01:10,536 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 05:01:10,545 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-19 05:01:10,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:01:10,606 INFO L208 MainTranslator]: Completed translation [2022-01-19 05:01:10,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10 WrapperNode [2022-01-19 05:01:10,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 05:01:10,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 05:01:10,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 05:01:10,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 05:01:10,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,642 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-19 05:01:10,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 05:01:10,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 05:01:10,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 05:01:10,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 05:01:10,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 05:01:10,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 05:01:10,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 05:01:10,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 05:01:10,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (1/1) ... [2022-01-19 05:01:10,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:01:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:01:10,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 05:01:10,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 05:01:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 05:01:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 05:01:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 05:01:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 05:01:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 05:01:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 05:01:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 05:01:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 05:01:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 05:01:10,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 05:01:10,736 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 05:01:10,862 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 05:01:10,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 05:01:11,257 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 05:01:11,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 05:01:11,476 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 05:01:11,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:01:11 BoogieIcfgContainer [2022-01-19 05:01:11,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 05:01:11,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 05:01:11,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 05:01:11,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 05:01:11,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:01:10" (1/3) ... [2022-01-19 05:01:11,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350cb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:01:11, skipping insertion in model container [2022-01-19 05:01:11,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:10" (2/3) ... [2022-01-19 05:01:11,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350cb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:01:11, skipping insertion in model container [2022-01-19 05:01:11,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:01:11" (3/3) ... [2022-01-19 05:01:11,484 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:11,488 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 05:01:11,488 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 05:01:11,488 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,523 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,524 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,524 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,524 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,524 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,524 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,525 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,525 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,525 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,525 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,525 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,526 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,527 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,527 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,527 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,527 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,527 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,528 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,529 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,530 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,531 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,531 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,531 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,531 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,531 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,532 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,533 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,534 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,534 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,534 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,535 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,536 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,538 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,539 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,540 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,541 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,542 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,546 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,546 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,546 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,547 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,547 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,547 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:11,547 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:01:11,585 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:01:11,591 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 05:01:11,591 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 05:01:11,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 05:01:11,645 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-01-19 05:01:11,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:01:11,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 05:01:11,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-01-19 05:01:11,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-01-19 05:01:11,664 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2022-01-19 05:01:11,664 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:01:11,664 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:11,665 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-19 05:01:11,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1650826075, now seen corresponding path program 1 times [2022-01-19 05:01:11,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:11,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494218230] [2022-01-19 05:01:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:11,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:11,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:11,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494218230] [2022-01-19 05:01:11,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494218230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:11,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:11,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 05:01:11,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623517004] [2022-01-19 05:01:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:11,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:01:11,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:01:11,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:01:11,965 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-01-19 05:01:11,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:11,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:11,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-01-19 05:01:11,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:12,058 INFO L129 PetriNetUnfolder]: 17/242 cut-off events. [2022-01-19 05:01:12,058 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 05:01:12,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 749 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-01-19 05:01:12,060 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-01-19 05:01:12,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2022-01-19 05:01:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:01:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:01:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-01-19 05:01:12,074 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2022-01-19 05:01:12,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-01-19 05:01:12,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-01-19 05:01:12,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:12,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-01-19 05:01:12,083 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-19 05:01:12,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,090 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2022-01-19 05:01:12,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2022-01-19 05:01:12,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 05:01:12,097 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-01-19 05:01:12,098 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-01-19 05:01:12,101 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-01-19 05:01:12,101 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-01-19 05:01:12,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:12,102 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-19 05:01:12,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 05:01:12,102 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-19 05:01:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 132457113, now seen corresponding path program 1 times [2022-01-19 05:01:12,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:12,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257787376] [2022-01-19 05:01:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:12,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:12,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257787376] [2022-01-19 05:01:12,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257787376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:12,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:12,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:12,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458291470] [2022-01-19 05:01:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:12,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:12,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:12,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-01-19 05:01:12,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:12,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-01-19 05:01:12,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:12,595 INFO L129 PetriNetUnfolder]: 282/964 cut-off events. [2022-01-19 05:01:12,595 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-01-19 05:01:12,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 964 events. 282/964 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6372 event pairs, 42 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1445. Up to 249 conditions per place. [2022-01-19 05:01:12,601 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2022-01-19 05:01:12,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2022-01-19 05:01:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-01-19 05:01:12,603 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2022-01-19 05:01:12,603 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-01-19 05:01:12,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-01-19 05:01:12,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:12,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-01-19 05:01:12,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,608 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,608 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2022-01-19 05:01:12,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2022-01-19 05:01:12,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 05:01:12,611 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-01-19 05:01:12,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-01-19 05:01:12,612 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-01-19 05:01:12,612 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-01-19 05:01:12,613 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-19 05:01:12,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:12,613 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] [2022-01-19 05:01:12,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 05:01:12,613 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-19 05:01:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -535801576, now seen corresponding path program 1 times [2022-01-19 05:01:12,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:12,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283499379] [2022-01-19 05:01:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:12,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:12,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283499379] [2022-01-19 05:01:12,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283499379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:12,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:12,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 05:01:12,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663201947] [2022-01-19 05:01:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:12,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 05:01:12,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 05:01:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-19 05:01:12,860 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:01:12,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:12,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:12,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:01:12,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:13,206 INFO L129 PetriNetUnfolder]: 214/566 cut-off events. [2022-01-19 05:01:13,206 INFO L130 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-01-19 05:01:13,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 566 events. 214/566 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2741 event pairs, 93 based on Foata normal form. 12/555 useless extension candidates. Maximal degree in co-relation 1255. Up to 230 conditions per place. [2022-01-19 05:01:13,210 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 16 selfloop transitions, 11 changer transitions 34/138 dead transitions. [2022-01-19 05:01:13,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 473 flow [2022-01-19 05:01:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:01:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:01:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1488 transitions. [2022-01-19 05:01:13,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2022-01-19 05:01:13,213 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1488 transitions. [2022-01-19 05:01:13,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1488 transitions. [2022-01-19 05:01:13,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:13,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1488 transitions. [2022-01-19 05:01:13,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,219 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,219 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 16 states and 1488 transitions. [2022-01-19 05:01:13,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 473 flow [2022-01-19 05:01:13,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 452 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 05:01:13,223 INFO L242 Difference]: Finished difference. Result has 132 places, 102 transitions, 316 flow [2022-01-19 05:01:13,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=316, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2022-01-19 05:01:13,224 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-01-19 05:01:13,224 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 316 flow [2022-01-19 05:01:13,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:13,225 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:13,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 05:01:13,225 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-19 05:01:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 415564952, now seen corresponding path program 1 times [2022-01-19 05:01:13,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:13,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123217060] [2022-01-19 05:01:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:13,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:13,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:13,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123217060] [2022-01-19 05:01:13,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123217060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:13,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:13,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:13,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321822039] [2022-01-19 05:01:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:13,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:13,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:13,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:13,303 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-01-19 05:01:13,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:13,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-01-19 05:01:13,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:13,489 INFO L129 PetriNetUnfolder]: 233/733 cut-off events. [2022-01-19 05:01:13,489 INFO L130 PetriNetUnfolder]: For 2007/2169 co-relation queries the response was YES. [2022-01-19 05:01:13,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 733 events. 233/733 cut-off events. For 2007/2169 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4123 event pairs, 75 based on Foata normal form. 18/723 useless extension candidates. Maximal degree in co-relation 2299. Up to 188 conditions per place. [2022-01-19 05:01:13,496 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 36 selfloop transitions, 12 changer transitions 6/134 dead transitions. [2022-01-19 05:01:13,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 643 flow [2022-01-19 05:01:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2022-01-19 05:01:13,498 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8613569321533924 [2022-01-19 05:01:13,498 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 876 transitions. [2022-01-19 05:01:13,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 876 transitions. [2022-01-19 05:01:13,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:13,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 876 transitions. [2022-01-19 05:01:13,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,502 INFO L186 Difference]: Start difference. First operand has 132 places, 102 transitions, 316 flow. Second operand 9 states and 876 transitions. [2022-01-19 05:01:13,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 643 flow [2022-01-19 05:01:13,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 609 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-01-19 05:01:13,507 INFO L242 Difference]: Finished difference. Result has 132 places, 111 transitions, 434 flow [2022-01-19 05:01:13,507 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=132, PETRI_TRANSITIONS=111} [2022-01-19 05:01:13,508 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-01-19 05:01:13,508 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 434 flow [2022-01-19 05:01:13,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,508 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:13,509 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-19 05:01:13,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 05:01:13,509 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-19 05:01:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1586545610, now seen corresponding path program 1 times [2022-01-19 05:01:13,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:13,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309379641] [2022-01-19 05:01:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:13,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:13,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:13,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309379641] [2022-01-19 05:01:13,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309379641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:13,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:13,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 05:01:13,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897078157] [2022-01-19 05:01:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:13,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 05:01:13,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:13,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 05:01:13,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 05:01:13,657 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:01:13,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 434 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:13,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:01:13,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:13,973 INFO L129 PetriNetUnfolder]: 292/849 cut-off events. [2022-01-19 05:01:13,973 INFO L130 PetriNetUnfolder]: For 3548/3654 co-relation queries the response was YES. [2022-01-19 05:01:13,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 849 events. 292/849 cut-off events. For 3548/3654 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5493 event pairs, 127 based on Foata normal form. 22/844 useless extension candidates. Maximal degree in co-relation 3008. Up to 281 conditions per place. [2022-01-19 05:01:13,978 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 18 selfloop transitions, 10 changer transitions 41/146 dead transitions. [2022-01-19 05:01:13,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 146 transitions, 848 flow [2022-01-19 05:01:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 05:01:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 05:01:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1207 transitions. [2022-01-19 05:01:13,981 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.821647379169503 [2022-01-19 05:01:13,981 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1207 transitions. [2022-01-19 05:01:13,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1207 transitions. [2022-01-19 05:01:13,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:13,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1207 transitions. [2022-01-19 05:01:13,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.84615384615384) internal successors, (1207), 13 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,985 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,985 INFO L186 Difference]: Start difference. First operand has 132 places, 111 transitions, 434 flow. Second operand 13 states and 1207 transitions. [2022-01-19 05:01:13,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 146 transitions, 848 flow [2022-01-19 05:01:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 767 flow, removed 39 selfloop flow, removed 1 redundant places. [2022-01-19 05:01:13,994 INFO L242 Difference]: Finished difference. Result has 150 places, 103 transitions, 382 flow [2022-01-19 05:01:13,994 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=382, PETRI_PLACES=150, PETRI_TRANSITIONS=103} [2022-01-19 05:01:13,995 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 32 predicate places. [2022-01-19 05:01:13,995 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 103 transitions, 382 flow [2022-01-19 05:01:13,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,995 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:13,996 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] [2022-01-19 05:01:13,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 05:01:13,996 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-19 05:01:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1445892104, now seen corresponding path program 1 times [2022-01-19 05:01:13,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:13,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225723237] [2022-01-19 05:01:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:13,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:14,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225723237] [2022-01-19 05:01:14,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225723237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:14,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:14,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 05:01:14,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986637674] [2022-01-19 05:01:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:14,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 05:01:14,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 05:01:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-19 05:01:14,178 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-01-19 05:01:14,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 103 transitions, 382 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:14,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-01-19 05:01:14,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:14,494 INFO L129 PetriNetUnfolder]: 112/420 cut-off events. [2022-01-19 05:01:14,494 INFO L130 PetriNetUnfolder]: For 2961/3013 co-relation queries the response was YES. [2022-01-19 05:01:14,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 420 events. 112/420 cut-off events. For 2961/3013 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1903 event pairs, 32 based on Foata normal form. 9/411 useless extension candidates. Maximal degree in co-relation 1590. Up to 143 conditions per place. [2022-01-19 05:01:14,498 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 27 selfloop transitions, 9 changer transitions 25/138 dead transitions. [2022-01-19 05:01:14,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 138 transitions, 830 flow [2022-01-19 05:01:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:01:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:01:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1482 transitions. [2022-01-19 05:01:14,501 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196902654867256 [2022-01-19 05:01:14,501 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1482 transitions. [2022-01-19 05:01:14,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1482 transitions. [2022-01-19 05:01:14,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:14,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1482 transitions. [2022-01-19 05:01:14,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.625) internal successors, (1482), 16 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-19 05:01:14,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,507 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,507 INFO L186 Difference]: Start difference. First operand has 150 places, 103 transitions, 382 flow. Second operand 16 states and 1482 transitions. [2022-01-19 05:01:14,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 138 transitions, 830 flow [2022-01-19 05:01:14,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 138 transitions, 733 flow, removed 41 selfloop flow, removed 14 redundant places. [2022-01-19 05:01:14,513 INFO L242 Difference]: Finished difference. Result has 149 places, 105 transitions, 400 flow [2022-01-19 05:01:14,514 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=400, PETRI_PLACES=149, PETRI_TRANSITIONS=105} [2022-01-19 05:01:14,516 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2022-01-19 05:01:14,516 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 105 transitions, 400 flow [2022-01-19 05:01:14,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:14,517 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-19 05:01:14,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 05:01:14,517 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-19 05:01:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 776151346, now seen corresponding path program 1 times [2022-01-19 05:01:14,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:14,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039974254] [2022-01-19 05:01:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:14,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:14,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:14,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039974254] [2022-01-19 05:01:14,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039974254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:14,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:14,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 05:01:14,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411548450] [2022-01-19 05:01:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:14,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 05:01:14,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 05:01:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 05:01:14,732 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-01-19 05:01:14,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 105 transitions, 400 flow. Second operand has 14 states, 14 states have (on average 88.35714285714286) internal successors, (1237), 14 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:14,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-01-19 05:01:14,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:14,962 INFO L129 PetriNetUnfolder]: 85/386 cut-off events. [2022-01-19 05:01:14,962 INFO L130 PetriNetUnfolder]: For 2702/2785 co-relation queries the response was YES. [2022-01-19 05:01:14,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 386 events. 85/386 cut-off events. For 2702/2785 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1814 event pairs, 26 based on Foata normal form. 6/374 useless extension candidates. Maximal degree in co-relation 1473. Up to 138 conditions per place. [2022-01-19 05:01:14,966 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 23 selfloop transitions, 10 changer transitions 13/121 dead transitions. [2022-01-19 05:01:14,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 121 transitions, 676 flow [2022-01-19 05:01:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 05:01:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 05:01:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1347 transitions. [2022-01-19 05:01:14,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7946902654867256 [2022-01-19 05:01:14,969 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1347 transitions. [2022-01-19 05:01:14,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1347 transitions. [2022-01-19 05:01:14,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:14,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1347 transitions. [2022-01-19 05:01:14,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.8) internal successors, (1347), 15 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,973 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,973 INFO L186 Difference]: Start difference. First operand has 149 places, 105 transitions, 400 flow. Second operand 15 states and 1347 transitions. [2022-01-19 05:01:14,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 121 transitions, 676 flow [2022-01-19 05:01:14,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 121 transitions, 581 flow, removed 41 selfloop flow, removed 13 redundant places. [2022-01-19 05:01:14,979 INFO L242 Difference]: Finished difference. Result has 148 places, 105 transitions, 393 flow [2022-01-19 05:01:14,979 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=393, PETRI_PLACES=148, PETRI_TRANSITIONS=105} [2022-01-19 05:01:14,980 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2022-01-19 05:01:14,980 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 105 transitions, 393 flow [2022-01-19 05:01:14,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 88.35714285714286) internal successors, (1237), 14 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:14,980 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:14,980 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-19 05:01:14,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 05:01:14,981 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-19 05:01:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1463612809, now seen corresponding path program 1 times [2022-01-19 05:01:14,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252223897] [2022-01-19 05:01:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:14,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:15,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252223897] [2022-01-19 05:01:15,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252223897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:15,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:15,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:15,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216971973] [2022-01-19 05:01:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:15,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:15,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:15,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 05:01:15,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 105 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:15,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 05:01:15,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:15,380 INFO L129 PetriNetUnfolder]: 988/2177 cut-off events. [2022-01-19 05:01:15,381 INFO L130 PetriNetUnfolder]: For 7154/7201 co-relation queries the response was YES. [2022-01-19 05:01:15,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 2177 events. 988/2177 cut-off events. For 7154/7201 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15653 event pairs, 39 based on Foata normal form. 40/2117 useless extension candidates. Maximal degree in co-relation 6586. Up to 696 conditions per place. [2022-01-19 05:01:15,394 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 45 selfloop transitions, 7 changer transitions 54/186 dead transitions. [2022-01-19 05:01:15,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 186 transitions, 1121 flow [2022-01-19 05:01:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 05:01:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 05:01:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-01-19 05:01:15,396 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2022-01-19 05:01:15,396 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-01-19 05:01:15,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-01-19 05:01:15,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:15,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-01-19 05:01:15,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,399 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,399 INFO L186 Difference]: Start difference. First operand has 148 places, 105 transitions, 393 flow. Second operand 10 states and 974 transitions. [2022-01-19 05:01:15,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 186 transitions, 1121 flow [2022-01-19 05:01:15,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 186 transitions, 1010 flow, removed 33 selfloop flow, removed 16 redundant places. [2022-01-19 05:01:15,408 INFO L242 Difference]: Finished difference. Result has 141 places, 109 transitions, 414 flow [2022-01-19 05:01:15,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=414, PETRI_PLACES=141, PETRI_TRANSITIONS=109} [2022-01-19 05:01:15,409 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2022-01-19 05:01:15,409 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 414 flow [2022-01-19 05:01:15,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:15,409 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-19 05:01:15,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 05:01:15,410 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-19 05:01:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1889517752, now seen corresponding path program 1 times [2022-01-19 05:01:15,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:15,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851419508] [2022-01-19 05:01:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:15,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:15,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851419508] [2022-01-19 05:01:15,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851419508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:15,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:15,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:01:15,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532455398] [2022-01-19 05:01:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:15,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:01:15,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:01:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:01:15,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 05:01:15,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 109 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:15,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 05:01:15,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:15,731 INFO L129 PetriNetUnfolder]: 475/1359 cut-off events. [2022-01-19 05:01:15,731 INFO L130 PetriNetUnfolder]: For 4324/4396 co-relation queries the response was YES. [2022-01-19 05:01:15,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4790 conditions, 1359 events. 475/1359 cut-off events. For 4324/4396 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9897 event pairs, 17 based on Foata normal form. 70/1405 useless extension candidates. Maximal degree in co-relation 4710. Up to 381 conditions per place. [2022-01-19 05:01:15,740 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 48 selfloop transitions, 18 changer transitions 30/175 dead transitions. [2022-01-19 05:01:15,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 1107 flow [2022-01-19 05:01:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:01:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:01:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1072 transitions. [2022-01-19 05:01:15,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8624296057924377 [2022-01-19 05:01:15,743 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1072 transitions. [2022-01-19 05:01:15,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1072 transitions. [2022-01-19 05:01:15,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:15,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1072 transitions. [2022-01-19 05:01:15,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.45454545454545) internal successors, (1072), 11 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,747 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,747 INFO L186 Difference]: Start difference. First operand has 141 places, 109 transitions, 414 flow. Second operand 11 states and 1072 transitions. [2022-01-19 05:01:15,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 1107 flow [2022-01-19 05:01:15,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 175 transitions, 1072 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-01-19 05:01:15,755 INFO L242 Difference]: Finished difference. Result has 147 places, 121 transitions, 564 flow [2022-01-19 05:01:15,755 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=564, PETRI_PLACES=147, PETRI_TRANSITIONS=121} [2022-01-19 05:01:15,755 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2022-01-19 05:01:15,755 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 121 transitions, 564 flow [2022-01-19 05:01:15,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,756 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:15,756 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-19 05:01:15,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 05:01:15,756 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-19 05:01:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1581495957, now seen corresponding path program 1 times [2022-01-19 05:01:15,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:15,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008341423] [2022-01-19 05:01:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:15,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:15,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008341423] [2022-01-19 05:01:15,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008341423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:15,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:15,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:01:15,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346028764] [2022-01-19 05:01:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:15,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:01:15,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:01:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:01:15,838 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-01-19 05:01:15,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 121 transitions, 564 flow. Second operand has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:15,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:15,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-01-19 05:01:15,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:16,141 INFO L129 PetriNetUnfolder]: 382/1185 cut-off events. [2022-01-19 05:01:16,142 INFO L130 PetriNetUnfolder]: For 4975/5068 co-relation queries the response was YES. [2022-01-19 05:01:16,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 1185 events. 382/1185 cut-off events. For 4975/5068 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9032 event pairs, 11 based on Foata normal form. 56/1219 useless extension candidates. Maximal degree in co-relation 4585. Up to 317 conditions per place. [2022-01-19 05:01:16,148 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 37 selfloop transitions, 22 changer transitions 36/174 dead transitions. [2022-01-19 05:01:16,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 174 transitions, 1148 flow [2022-01-19 05:01:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 05:01:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 05:01:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1333 transitions. [2022-01-19 05:01:16,152 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8426042983565107 [2022-01-19 05:01:16,152 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1333 transitions. [2022-01-19 05:01:16,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1333 transitions. [2022-01-19 05:01:16,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:16,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1333 transitions. [2022-01-19 05:01:16,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.21428571428571) internal successors, (1333), 14 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,158 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,158 INFO L186 Difference]: Start difference. First operand has 147 places, 121 transitions, 564 flow. Second operand 14 states and 1333 transitions. [2022-01-19 05:01:16,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 174 transitions, 1148 flow [2022-01-19 05:01:16,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 174 transitions, 952 flow, removed 89 selfloop flow, removed 12 redundant places. [2022-01-19 05:01:16,174 INFO L242 Difference]: Finished difference. Result has 155 places, 122 transitions, 537 flow [2022-01-19 05:01:16,175 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=537, PETRI_PLACES=155, PETRI_TRANSITIONS=122} [2022-01-19 05:01:16,175 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-01-19 05:01:16,176 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 122 transitions, 537 flow [2022-01-19 05:01:16,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:16,176 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:16,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 05:01:16,176 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-19 05:01:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1507999674, now seen corresponding path program 1 times [2022-01-19 05:01:16,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652132746] [2022-01-19 05:01:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:16,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:16,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:16,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652132746] [2022-01-19 05:01:16,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652132746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:16,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:16,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 05:01:16,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824279695] [2022-01-19 05:01:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:16,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 05:01:16,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 05:01:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-19 05:01:16,358 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-01-19 05:01:16,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 122 transitions, 537 flow. Second operand has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:16,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-01-19 05:01:16,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:16,686 INFO L129 PetriNetUnfolder]: 211/1249 cut-off events. [2022-01-19 05:01:16,687 INFO L130 PetriNetUnfolder]: For 3123/3272 co-relation queries the response was YES. [2022-01-19 05:01:16,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1249 events. 211/1249 cut-off events. For 3123/3272 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12030 event pairs, 3 based on Foata normal form. 1/1168 useless extension candidates. Maximal degree in co-relation 3692. Up to 183 conditions per place. [2022-01-19 05:01:16,696 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 20 selfloop transitions, 5 changer transitions 33/148 dead transitions. [2022-01-19 05:01:16,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 148 transitions, 753 flow [2022-01-19 05:01:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 05:01:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 05:01:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1253 transitions. [2022-01-19 05:01:16,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7920353982300885 [2022-01-19 05:01:16,713 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1253 transitions. [2022-01-19 05:01:16,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1253 transitions. [2022-01-19 05:01:16,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:16,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1253 transitions. [2022-01-19 05:01:16,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.5) internal successors, (1253), 14 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,716 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,717 INFO L186 Difference]: Start difference. First operand has 155 places, 122 transitions, 537 flow. Second operand 14 states and 1253 transitions. [2022-01-19 05:01:16,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 148 transitions, 753 flow [2022-01-19 05:01:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 148 transitions, 675 flow, removed 21 selfloop flow, removed 13 redundant places. [2022-01-19 05:01:16,758 INFO L242 Difference]: Finished difference. Result has 159 places, 114 transitions, 439 flow [2022-01-19 05:01:16,758 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=439, PETRI_PLACES=159, PETRI_TRANSITIONS=114} [2022-01-19 05:01:16,758 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 41 predicate places. [2022-01-19 05:01:16,758 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 114 transitions, 439 flow [2022-01-19 05:01:16,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:16,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:16,771 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:16,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 05:01:16,772 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-19 05:01:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 94365038, now seen corresponding path program 2 times [2022-01-19 05:01:16,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:16,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422284343] [2022-01-19 05:01:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:16,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:17,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:17,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422284343] [2022-01-19 05:01:17,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422284343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:17,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:17,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 05:01:17,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68880502] [2022-01-19 05:01:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:17,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 05:01:17,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 05:01:17,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-01-19 05:01:17,109 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-01-19 05:01:17,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 114 transitions, 439 flow. Second operand has 14 states, 14 states have (on average 87.57142857142857) internal successors, (1226), 14 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:17,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-01-19 05:01:17,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:17,322 INFO L129 PetriNetUnfolder]: 51/476 cut-off events. [2022-01-19 05:01:17,322 INFO L130 PetriNetUnfolder]: For 477/490 co-relation queries the response was YES. [2022-01-19 05:01:17,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 476 events. 51/476 cut-off events. For 477/490 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3340 event pairs, 0 based on Foata normal form. 3/460 useless extension candidates. Maximal degree in co-relation 1129. Up to 66 conditions per place. [2022-01-19 05:01:17,325 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 17 selfloop transitions, 6 changer transitions 8/121 dead transitions. [2022-01-19 05:01:17,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 121 transitions, 527 flow [2022-01-19 05:01:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 05:01:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 05:01:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1063 transitions. [2022-01-19 05:01:17,326 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7839233038348082 [2022-01-19 05:01:17,326 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1063 transitions. [2022-01-19 05:01:17,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1063 transitions. [2022-01-19 05:01:17,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:17,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1063 transitions. [2022-01-19 05:01:17,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 88.58333333333333) internal successors, (1063), 12 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,330 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,330 INFO L186 Difference]: Start difference. First operand has 159 places, 114 transitions, 439 flow. Second operand 12 states and 1063 transitions. [2022-01-19 05:01:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 121 transitions, 527 flow [2022-01-19 05:01:17,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 121 transitions, 478 flow, removed 15 selfloop flow, removed 16 redundant places. [2022-01-19 05:01:17,335 INFO L242 Difference]: Finished difference. Result has 148 places, 112 transitions, 410 flow [2022-01-19 05:01:17,335 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=410, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2022-01-19 05:01:17,335 INFO L334 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2022-01-19 05:01:17,336 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 410 flow [2022-01-19 05:01:17,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.57142857142857) internal successors, (1226), 14 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:17,336 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:17,336 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:17,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 05:01:17,337 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-19 05:01:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 901065468, now seen corresponding path program 3 times [2022-01-19 05:01:17,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:17,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410517591] [2022-01-19 05:01:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:17,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:17,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:01:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:17,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:01:17,419 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:01:17,420 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 05:01:17,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 05:01:17,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 05:01:17,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 05:01:17,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 05:01:17,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 05:01:17,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 05:01:17,424 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:17,427 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 05:01:17,427 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 05:01:17,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 05:01:17 BasicIcfg [2022-01-19 05:01:17,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 05:01:17,530 INFO L158 Benchmark]: Toolchain (without parser) took 7384.94ms. Allocated memory was 406.8MB in the beginning and 817.9MB in the end (delta: 411.0MB). Free memory was 347.0MB in the beginning and 470.9MB in the end (delta: -123.9MB). Peak memory consumption was 289.1MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,530 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 406.8MB. Free memory is still 365.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 05:01:17,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.06ms. Allocated memory was 406.8MB in the beginning and 520.1MB in the end (delta: 113.2MB). Free memory was 346.9MB in the beginning and 476.5MB in the end (delta: -129.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.57ms. Allocated memory is still 520.1MB. Free memory was 476.5MB in the beginning and 473.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,532 INFO L158 Benchmark]: Boogie Preprocessor took 20.86ms. Allocated memory is still 520.1MB. Free memory was 473.4MB in the beginning and 471.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,532 INFO L158 Benchmark]: RCFGBuilder took 813.93ms. Allocated memory is still 520.1MB. Free memory was 471.3MB in the beginning and 397.9MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,532 INFO L158 Benchmark]: TraceAbstraction took 6050.68ms. Allocated memory was 520.1MB in the beginning and 817.9MB in the end (delta: 297.8MB). Free memory was 397.9MB in the beginning and 470.9MB in the end (delta: -73.0MB). Peak memory consumption was 225.9MB. Max. memory is 16.0GB. [2022-01-19 05:01:17,533 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.09ms. Allocated memory is still 406.8MB. Free memory is still 365.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 460.06ms. Allocated memory was 406.8MB in the beginning and 520.1MB in the end (delta: 113.2MB). Free memory was 346.9MB in the beginning and 476.5MB in the end (delta: -129.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.57ms. Allocated memory is still 520.1MB. Free memory was 476.5MB in the beginning and 473.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.86ms. Allocated memory is still 520.1MB. Free memory was 473.4MB in the beginning and 471.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 813.93ms. Allocated memory is still 520.1MB. Free memory was 471.3MB in the beginning and 397.9MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 6050.68ms. Allocated memory was 520.1MB in the beginning and 817.9MB in the end (delta: 297.8MB). Free memory was 397.9MB in the beginning and 470.9MB in the end (delta: -73.0MB). Peak memory consumption was 225.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2516; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 611 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 882 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1402 IncrementalHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 107 mSDtfsCounter, 1402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=9, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 919 ConstructedInterpolants, 0 QuantifiedInterpolants, 5779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 05:01:17,587 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...