/usr/bin/java -Xmx8000000000 -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-OGIterative-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 10:13:48,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 10:13:48,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 10:13:48,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 10:13:48,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 10:13:48,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 10:13:48,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 10:13:48,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 10:13:48,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 10:13:48,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 10:13:48,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 10:13:48,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 10:13:48,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 10:13:48,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 10:13:48,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 10:13:48,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 10:13:48,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 10:13:48,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 10:13:48,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 10:13:48,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 10:13:48,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 10:13:48,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 10:13:48,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 10:13:48,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 10:13:48,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 10:13:48,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 10:13:48,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 10:13:48,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 10:13:48,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 10:13:48,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 10:13:48,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 10:13:48,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 10:13:48,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 10:13:48,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 10:13:48,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 10:13:48,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 10:13:48,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 10:13:48,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 10:13:48,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 10:13:48,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 10:13:48,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 10:13:48,340 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-OGIterative-Hitting.epf [2021-08-13 10:13:48,374 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 10:13:48,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 10:13:48,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 10:13:48,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 10:13:48,375 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 10:13:48,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 10:13:48,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 10:13:48,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 10:13:48,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 10:13:48,377 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 10:13:48,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 10:13:48,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 10:13:48,378 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 10:13:48,378 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 10:13:48,378 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 [2021-08-13 10:13:48,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 10:13:48,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 10:13:48,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 10:13:48,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 10:13:48,684 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 10:13:48,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-08-13 10:13:48,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7034ff43f/e713c095b1554295b4e3bf47dbbc10a8/FLAG9c624b10f [2021-08-13 10:13:49,191 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 10:13:49,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-08-13 10:13:49,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7034ff43f/e713c095b1554295b4e3bf47dbbc10a8/FLAG9c624b10f [2021-08-13 10:13:49,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7034ff43f/e713c095b1554295b4e3bf47dbbc10a8 [2021-08-13 10:13:49,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 10:13:49,726 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 10:13:49,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 10:13:49,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 10:13:49,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 10:13:49,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:13:49" (1/1) ... [2021-08-13 10:13:49,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc36b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:49, skipping insertion in model container [2021-08-13 10:13:49,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:13:49" (1/1) ... [2021-08-13 10:13:49,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 10:13:49,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 10:13:49,902 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-08-13 10:13:50,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:13:50,091 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 10:13:50,102 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-08-13 10:13:50,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:13:50,201 INFO L208 MainTranslator]: Completed translation [2021-08-13 10:13:50,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50 WrapperNode [2021-08-13 10:13:50,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 10:13:50,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 10:13:50,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 10:13:50,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 10:13:50,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 10:13:50,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 10:13:50,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 10:13:50,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 10:13:50,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... [2021-08-13 10:13:50,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 10:13:50,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 10:13:50,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 10:13:50,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 10:13:50,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 10:13:50,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 10:13:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 10:13:50,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 10:13:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 10:13:50,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 10:13:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 10:13:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 10:13:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 10:13:50,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 10:13:50,346 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 10:13:51,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 10:13:51,591 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 10:13:51,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:13:51 BoogieIcfgContainer [2021-08-13 10:13:51,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 10:13:51,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 10:13:51,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 10:13:51,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 10:13:51,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 10:13:49" (1/3) ... [2021-08-13 10:13:51,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36fe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:13:51, skipping insertion in model container [2021-08-13 10:13:51,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:13:50" (2/3) ... [2021-08-13 10:13:51,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36fe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:13:51, skipping insertion in model container [2021-08-13 10:13:51,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:13:51" (3/3) ... [2021-08-13 10:13:51,599 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2021-08-13 10:13:51,605 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 10:13:51,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 10:13:51,606 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 10:13:51,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,637 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,648 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,652 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,658 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:13:51,659 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 10:13:51,676 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 10:13:51,689 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 10:13:51,689 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 10:13:51,689 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 10:13:51,689 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 10:13:51,690 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 10:13:51,690 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 10:13:51,690 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 10:13:51,690 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 10:13:51,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2021-08-13 10:13:51,725 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2021-08-13 10:13:51,725 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:13:51,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-13 10:13:51,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2021-08-13 10:13:51,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2021-08-13 10:13:51,741 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-08-13 10:13:51,741 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:13:51,742 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:51,742 INFO L266 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] [2021-08-13 10:13:51,742 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1864432522, now seen corresponding path program 1 times [2021-08-13 10:13:51,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:51,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869921434] [2021-08-13 10:13:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:51,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:51,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:51,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:51,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:51,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:51,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869921434] [2021-08-13 10:13:51,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869921434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:51,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:51,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 10:13:51,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440525271] [2021-08-13 10:13:51,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 10:13:51,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 10:13:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 10:13:51,953 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 109 [2021-08-13 10:13:51,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:51,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:51,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 109 [2021-08-13 10:13:51,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:52,007 INFO L129 PetriNetUnfolder]: 16/220 cut-off events. [2021-08-13 10:13:52,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:13:52,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 220 events. 16/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 665 event pairs, 6 based on Foata normal form. 9/218 useless extension candidates. Maximal degree in co-relation 216. Up to 27 conditions per place. [2021-08-13 10:13:52,010 INFO L132 encePairwiseOnDemand]: 104/109 looper letters, 7 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2021-08-13 10:13:52,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 237 flow [2021-08-13 10:13:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 10:13:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 10:13:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2021-08-13 10:13:52,018 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9510703363914373 [2021-08-13 10:13:52,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2021-08-13 10:13:52,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2021-08-13 10:13:52,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:52,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2021-08-13 10:13:52,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,028 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2021-08-13 10:13:52,028 INFO L482 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 237 flow [2021-08-13 10:13:52,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,029 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:52,030 INFO L266 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] [2021-08-13 10:13:52,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 10:13:52,030 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1603108185, now seen corresponding path program 1 times [2021-08-13 10:13:52,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:52,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932497640] [2021-08-13 10:13:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:52,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:52,178 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:52,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:52,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:52,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:52,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932497640] [2021-08-13 10:13:52,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932497640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:52,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:52,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:13:52,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582917146] [2021-08-13 10:13:52,205 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:13:52,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:52,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:13:52,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:13:52,207 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 109 [2021-08-13 10:13:52,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:52,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 109 [2021-08-13 10:13:52,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:52,377 INFO L129 PetriNetUnfolder]: 143/790 cut-off events. [2021-08-13 10:13:52,377 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-08-13 10:13:52,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 790 events. 143/790 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5678 event pairs, 34 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 1093. Up to 149 conditions per place. [2021-08-13 10:13:52,382 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 10 selfloop transitions, 3 changer transitions 22/129 dead transitions. [2021-08-13 10:13:52,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 129 transitions, 359 flow [2021-08-13 10:13:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:13:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:13:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2021-08-13 10:13:52,386 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9164118246687054 [2021-08-13 10:13:52,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2021-08-13 10:13:52,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2021-08-13 10:13:52,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:52,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2021-08-13 10:13:52,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.88888888888889) internal successors, (899), 9 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,390 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,391 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2021-08-13 10:13:52,391 INFO L482 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 359 flow [2021-08-13 10:13:52,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,391 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:52,391 INFO L266 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] [2021-08-13 10:13:52,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 10:13:52,392 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 499998184, now seen corresponding path program 1 times [2021-08-13 10:13:52,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:52,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728811576] [2021-08-13 10:13:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:52,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:52,460 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:52,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:52,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:52,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:52,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728811576] [2021-08-13 10:13:52,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728811576] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:52,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:52,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:13:52,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297732890] [2021-08-13 10:13:52,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:13:52,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:13:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:13:52,488 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 109 [2021-08-13 10:13:52,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:52,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 109 [2021-08-13 10:13:52,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:52,706 INFO L129 PetriNetUnfolder]: 244/1259 cut-off events. [2021-08-13 10:13:52,707 INFO L130 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2021-08-13 10:13:52,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 1259 events. 244/1259 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10949 event pairs, 41 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 2018. Up to 207 conditions per place. [2021-08-13 10:13:52,712 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 7 selfloop transitions, 2 changer transitions 52/158 dead transitions. [2021-08-13 10:13:52,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 158 transitions, 571 flow [2021-08-13 10:13:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:13:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:13:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2021-08-13 10:13:52,714 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9133537206931702 [2021-08-13 10:13:52,714 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2021-08-13 10:13:52,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2021-08-13 10:13:52,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:52,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2021-08-13 10:13:52,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,718 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,718 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 16 predicate places. [2021-08-13 10:13:52,718 INFO L482 AbstractCegarLoop]: Abstraction has has 130 places, 158 transitions, 571 flow [2021-08-13 10:13:52,719 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,719 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:52,719 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:52,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 10:13:52,719 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1120694261, now seen corresponding path program 1 times [2021-08-13 10:13:52,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:52,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064450541] [2021-08-13 10:13:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:52,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:52,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:52,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:52,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 10:13:52,820 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 10:13:52,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 10:13:52,838 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:52,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:52,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:52,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:52,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:52,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:52,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064450541] [2021-08-13 10:13:52,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064450541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:52,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:52,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 10:13:52,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937971382] [2021-08-13 10:13:52,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 10:13:52,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:52,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 10:13:52,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 10:13:52,870 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2021-08-13 10:13:52,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 158 transitions, 571 flow. Second operand has 10 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:52,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:52,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2021-08-13 10:13:52,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:53,417 INFO L129 PetriNetUnfolder]: 981/3069 cut-off events. [2021-08-13 10:13:53,417 INFO L130 PetriNetUnfolder]: For 854/922 co-relation queries the response was YES. [2021-08-13 10:13:53,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6359 conditions, 3069 events. 981/3069 cut-off events. For 854/922 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 28626 event pairs, 112 based on Foata normal form. 3/3032 useless extension candidates. Maximal degree in co-relation 6297. Up to 491 conditions per place. [2021-08-13 10:13:53,434 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 16 selfloop transitions, 8 changer transitions 157/259 dead transitions. [2021-08-13 10:13:53,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 259 transitions, 1411 flow [2021-08-13 10:13:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 10:13:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 10:13:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1471 transitions. [2021-08-13 10:13:53,438 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8434633027522935 [2021-08-13 10:13:53,438 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1471 transitions. [2021-08-13 10:13:53,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1471 transitions. [2021-08-13 10:13:53,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:53,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1471 transitions. [2021-08-13 10:13:53,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.9375) internal successors, (1471), 16 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:53,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:53,443 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:53,443 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 31 predicate places. [2021-08-13 10:13:53,444 INFO L482 AbstractCegarLoop]: Abstraction has has 145 places, 259 transitions, 1411 flow [2021-08-13 10:13:53,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:53,444 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:53,444 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:53,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 10:13:53,444 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 356625219, now seen corresponding path program 1 times [2021-08-13 10:13:53,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:53,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227089652] [2021-08-13 10:13:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:53,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:53,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:53,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:53,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:53,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-13 10:13:53,532 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-08-13 10:13:53,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-13 10:13:53,538 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:53,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:53,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:53,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:53,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:53,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:53,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:53,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227089652] [2021-08-13 10:13:53,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227089652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:53,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:53,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 10:13:53,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249944709] [2021-08-13 10:13:53,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 10:13:53,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 10:13:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 10:13:53,568 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2021-08-13 10:13:53,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 259 transitions, 1411 flow. Second operand has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:53,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:53,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2021-08-13 10:13:53,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:54,268 INFO L129 PetriNetUnfolder]: 1173/3732 cut-off events. [2021-08-13 10:13:54,268 INFO L130 PetriNetUnfolder]: For 1551/1838 co-relation queries the response was YES. [2021-08-13 10:13:54,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9233 conditions, 3732 events. 1173/3732 cut-off events. For 1551/1838 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 36569 event pairs, 85 based on Foata normal form. 12/3708 useless extension candidates. Maximal degree in co-relation 9165. Up to 1092 conditions per place. [2021-08-13 10:13:54,285 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 19 selfloop transitions, 10 changer transitions 241/349 dead transitions. [2021-08-13 10:13:54,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 349 transitions, 2575 flow [2021-08-13 10:13:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 10:13:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 10:13:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1130 transitions. [2021-08-13 10:13:54,288 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.863914373088685 [2021-08-13 10:13:54,288 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1130 transitions. [2021-08-13 10:13:54,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1130 transitions. [2021-08-13 10:13:54,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:54,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1130 transitions. [2021-08-13 10:13:54,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.16666666666667) internal successors, (1130), 12 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:54,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:54,293 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:54,293 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 42 predicate places. [2021-08-13 10:13:54,293 INFO L482 AbstractCegarLoop]: Abstraction has has 156 places, 349 transitions, 2575 flow [2021-08-13 10:13:54,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:54,293 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:54,293 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:54,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 10:13:54,294 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1398457445, now seen corresponding path program 2 times [2021-08-13 10:13:54,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:54,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016688948] [2021-08-13 10:13:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:54,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:54,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:54,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:54,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:54,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 10:13:54,384 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 10:13:54,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 10:13:54,401 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-13 10:13:54,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 10:13:54,421 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:54,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:54,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:54,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:54,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:54,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:54,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:54,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016688948] [2021-08-13 10:13:54,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016688948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:54,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:54,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 10:13:54,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340353794] [2021-08-13 10:13:54,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 10:13:54,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 10:13:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-08-13 10:13:54,453 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2021-08-13 10:13:54,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 349 transitions, 2575 flow. Second operand has 11 states, 11 states have (on average 89.27272727272727) internal successors, (982), 11 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:54,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:54,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2021-08-13 10:13:54,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:55,255 INFO L129 PetriNetUnfolder]: 1313/4264 cut-off events. [2021-08-13 10:13:55,255 INFO L130 PetriNetUnfolder]: For 2284/2727 co-relation queries the response was YES. [2021-08-13 10:13:55,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12172 conditions, 4264 events. 1313/4264 cut-off events. For 2284/2727 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 43530 event pairs, 85 based on Foata normal form. 30/4258 useless extension candidates. Maximal degree in co-relation 12097. Up to 1278 conditions per place. [2021-08-13 10:13:55,277 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 19 selfloop transitions, 14 changer transitions 297/408 dead transitions. [2021-08-13 10:13:55,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 408 transitions, 3735 flow [2021-08-13 10:13:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 10:13:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 10:13:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1751 transitions. [2021-08-13 10:13:55,282 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8454852728150651 [2021-08-13 10:13:55,282 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1751 transitions. [2021-08-13 10:13:55,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1751 transitions. [2021-08-13 10:13:55,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:55,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1751 transitions. [2021-08-13 10:13:55,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 92.15789473684211) internal successors, (1751), 19 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:55,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 109.0) internal successors, (2180), 20 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:55,288 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 109.0) internal successors, (2180), 20 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:55,288 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 60 predicate places. [2021-08-13 10:13:55,288 INFO L482 AbstractCegarLoop]: Abstraction has has 174 places, 408 transitions, 3735 flow [2021-08-13 10:13:55,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 89.27272727272727) internal successors, (982), 11 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:55,288 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:55,288 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:55,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 10:13:55,289 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash 58968035, now seen corresponding path program 3 times [2021-08-13 10:13:55,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:55,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794007741] [2021-08-13 10:13:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:55,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:55,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:55,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:55,391 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 10:13:55,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 10:13:55,397 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 10:13:55,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 10:13:55,409 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 10:13:55,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 10:13:55,425 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:55,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:55,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:55,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:55,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:55,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:55,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:55,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794007741] [2021-08-13 10:13:55,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794007741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:55,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:55,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 10:13:55,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245813561] [2021-08-13 10:13:55,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 10:13:55,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 10:13:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 10:13:55,458 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2021-08-13 10:13:55,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 408 transitions, 3735 flow. Second operand has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:55,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:55,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2021-08-13 10:13:55,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:56,315 INFO L129 PetriNetUnfolder]: 1763/5716 cut-off events. [2021-08-13 10:13:56,315 INFO L130 PetriNetUnfolder]: For 3730/4379 co-relation queries the response was YES. [2021-08-13 10:13:56,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18750 conditions, 5716 events. 1763/5716 cut-off events. For 3730/4379 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 62198 event pairs, 73 based on Foata normal form. 34/5710 useless extension candidates. Maximal degree in co-relation 18669. Up to 1676 conditions per place. [2021-08-13 10:13:56,355 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 23 selfloop transitions, 18 changer transitions 435/555 dead transitions. [2021-08-13 10:13:56,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 555 transitions, 6311 flow [2021-08-13 10:13:56,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 10:13:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 10:13:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1308 transitions. [2021-08-13 10:13:56,358 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-08-13 10:13:56,358 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1308 transitions. [2021-08-13 10:13:56,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1308 transitions. [2021-08-13 10:13:56,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:56,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1308 transitions. [2021-08-13 10:13:56,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.42857142857143) internal successors, (1308), 14 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:56,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:56,363 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:56,363 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 73 predicate places. [2021-08-13 10:13:56,363 INFO L482 AbstractCegarLoop]: Abstraction has has 187 places, 555 transitions, 6311 flow [2021-08-13 10:13:56,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:56,364 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:56,364 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:56,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 10:13:56,364 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:56,365 INFO L82 PathProgramCache]: Analyzing trace with hash -653066239, now seen corresponding path program 4 times [2021-08-13 10:13:56,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:56,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829714066] [2021-08-13 10:13:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:56,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:56,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:56,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:56,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:56,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 10:13:56,459 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 10:13:56,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 10:13:56,471 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:56,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:56,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:56,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:56,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:56,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:56,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:56,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829714066] [2021-08-13 10:13:56,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829714066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:56,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:56,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 10:13:56,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865722734] [2021-08-13 10:13:56,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 10:13:56,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 10:13:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-13 10:13:56,507 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2021-08-13 10:13:56,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 555 transitions, 6311 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:56,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:56,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2021-08-13 10:13:56,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:57,420 INFO L129 PetriNetUnfolder]: 1833/6045 cut-off events. [2021-08-13 10:13:57,420 INFO L130 PetriNetUnfolder]: For 4892/5697 co-relation queries the response was YES. [2021-08-13 10:13:57,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22124 conditions, 6045 events. 1833/6045 cut-off events. For 4892/5697 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 67124 event pairs, 61 based on Foata normal form. 39/6050 useless extension candidates. Maximal degree in co-relation 22036. Up to 1788 conditions per place. [2021-08-13 10:13:57,518 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 32 selfloop transitions, 12 changer transitions 491/613 dead transitions. [2021-08-13 10:13:57,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 613 transitions, 8109 flow [2021-08-13 10:13:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 10:13:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 10:13:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1112 transitions. [2021-08-13 10:13:57,521 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8501529051987767 [2021-08-13 10:13:57,521 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1112 transitions. [2021-08-13 10:13:57,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1112 transitions. [2021-08-13 10:13:57,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:57,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1112 transitions. [2021-08-13 10:13:57,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.66666666666667) internal successors, (1112), 12 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:57,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:57,525 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:57,525 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 84 predicate places. [2021-08-13 10:13:57,525 INFO L482 AbstractCegarLoop]: Abstraction has has 198 places, 613 transitions, 8109 flow [2021-08-13 10:13:57,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:57,525 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:57,526 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:57,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 10:13:57,526 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1508581688, now seen corresponding path program 1 times [2021-08-13 10:13:57,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:57,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134135441] [2021-08-13 10:13:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:57,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:57,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:57,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:57,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:57,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 10:13:57,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 10:13:57,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:57,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 10:13:57,664 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 10:13:57,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 10:13:57,688 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-13 10:13:57,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 10:13:57,709 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:57,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:57,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:57,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:57,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:57,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:57,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:57,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134135441] [2021-08-13 10:13:57,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134135441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:57,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:57,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-13 10:13:57,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235522801] [2021-08-13 10:13:57,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-13 10:13:57,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-13 10:13:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-08-13 10:13:57,742 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 109 [2021-08-13 10:13:57,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 613 transitions, 8109 flow. Second operand has 14 states, 14 states have (on average 87.21428571428571) internal successors, (1221), 14 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:57,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:57,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 109 [2021-08-13 10:13:57,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:58,959 INFO L129 PetriNetUnfolder]: 1907/6490 cut-off events. [2021-08-13 10:13:58,959 INFO L130 PetriNetUnfolder]: For 6965/8221 co-relation queries the response was YES. [2021-08-13 10:13:58,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25932 conditions, 6490 events. 1907/6490 cut-off events. For 6965/8221 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 73863 event pairs, 49 based on Foata normal form. 33/6489 useless extension candidates. Maximal degree in co-relation 25835. Up to 1910 conditions per place. [2021-08-13 10:13:58,996 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 34 selfloop transitions, 14 changer transitions 566/690 dead transitions. [2021-08-13 10:13:58,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 690 transitions, 10503 flow [2021-08-13 10:13:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 10:13:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 10:13:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1619 transitions. [2021-08-13 10:13:58,999 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8251783893985729 [2021-08-13 10:13:58,999 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1619 transitions. [2021-08-13 10:13:58,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1619 transitions. [2021-08-13 10:13:59,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:59,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1619 transitions. [2021-08-13 10:13:59,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.94444444444444) internal successors, (1619), 18 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:59,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:59,005 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:59,005 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 101 predicate places. [2021-08-13 10:13:59,005 INFO L482 AbstractCegarLoop]: Abstraction has has 215 places, 690 transitions, 10503 flow [2021-08-13 10:13:59,006 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 87.21428571428571) internal successors, (1221), 14 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:59,006 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:59,006 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:59,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 10:13:59,006 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1980637232, now seen corresponding path program 2 times [2021-08-13 10:13:59,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:59,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52011676] [2021-08-13 10:13:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:59,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:59,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:59,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:59,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:13:59,074 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 10:13:59,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 10:13:59,079 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 10:13:59,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 10:13:59,097 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 10:13:59,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 10:13:59,116 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 10:13:59,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 10:13:59,129 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:59,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:59,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:59,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:59,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:59,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:59,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:59,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52011676] [2021-08-13 10:13:59,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52011676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:59,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:59,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 10:13:59,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754232659] [2021-08-13 10:13:59,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 10:13:59,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 10:13:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-13 10:13:59,162 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2021-08-13 10:13:59,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 690 transitions, 10503 flow. Second operand has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:59,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:59,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2021-08-13 10:13:59,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:00,235 INFO L129 PetriNetUnfolder]: 1953/6921 cut-off events. [2021-08-13 10:14:00,236 INFO L130 PetriNetUnfolder]: For 8787/10233 co-relation queries the response was YES. [2021-08-13 10:14:00,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29895 conditions, 6921 events. 1953/6921 cut-off events. For 8787/10233 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 81063 event pairs, 41 based on Foata normal form. 44/6930 useless extension candidates. Maximal degree in co-relation 29790. Up to 2022 conditions per place. [2021-08-13 10:14:00,272 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 40 selfloop transitions, 13 changer transitions 604/734 dead transitions. [2021-08-13 10:14:00,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 734 transitions, 12555 flow [2021-08-13 10:14:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 10:14:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 10:14:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 916 transitions. [2021-08-13 10:14:00,274 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8403669724770643 [2021-08-13 10:14:00,274 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 916 transitions. [2021-08-13 10:14:00,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 916 transitions. [2021-08-13 10:14:00,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:00,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 916 transitions. [2021-08-13 10:14:00,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:00,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:00,277 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:00,278 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 110 predicate places. [2021-08-13 10:14:00,278 INFO L482 AbstractCegarLoop]: Abstraction has has 224 places, 734 transitions, 12555 flow [2021-08-13 10:14:00,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:00,278 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:00,278 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:14:00,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 10:14:00,278 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1722678476, now seen corresponding path program 3 times [2021-08-13 10:14:00,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:00,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298092258] [2021-08-13 10:14:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:00,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:00,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:00,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:14:00,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:14:00,347 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 10:14:00,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 10:14:00,363 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 10:14:00,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 10:14:00,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:14:00,392 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-08-13 10:14:00,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-08-13 10:14:00,402 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:14:00,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:14:00,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:00,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:00,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:00,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:00,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:00,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298092258] [2021-08-13 10:14:00,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298092258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:00,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:00,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 10:14:00,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113467443] [2021-08-13 10:14:00,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 10:14:00,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 10:14:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-13 10:14:00,437 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2021-08-13 10:14:00,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 734 transitions, 12555 flow. Second operand has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:00,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:00,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2021-08-13 10:14:00,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:01,685 INFO L129 PetriNetUnfolder]: 1976/7124 cut-off events. [2021-08-13 10:14:01,685 INFO L130 PetriNetUnfolder]: For 10464/12214 co-relation queries the response was YES. [2021-08-13 10:14:01,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33132 conditions, 7124 events. 1976/7124 cut-off events. For 10464/12214 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 84538 event pairs, 33 based on Foata normal form. 44/7135 useless extension candidates. Maximal degree in co-relation 33019. Up to 2060 conditions per place. [2021-08-13 10:14:01,728 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 40 selfloop transitions, 13 changer transitions 644/774 dead transitions. [2021-08-13 10:14:01,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 774 transitions, 14697 flow [2021-08-13 10:14:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:14:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:14:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2021-08-13 10:14:01,731 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8362738179251941 [2021-08-13 10:14:01,731 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1185 transitions. [2021-08-13 10:14:01,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1185 transitions. [2021-08-13 10:14:01,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:01,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1185 transitions. [2021-08-13 10:14:01,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.15384615384616) internal successors, (1185), 13 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:01,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:01,735 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:01,736 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 122 predicate places. [2021-08-13 10:14:01,736 INFO L482 AbstractCegarLoop]: Abstraction has has 236 places, 774 transitions, 14697 flow [2021-08-13 10:14:01,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:01,736 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:01,736 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:14:01,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 10:14:01,736 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:01,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1967161844, now seen corresponding path program 1 times [2021-08-13 10:14:01,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:01,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525727456] [2021-08-13 10:14:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:01,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:01,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:01,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:01,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:01,776 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:14:01,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:14:01,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:01,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:14:01,795 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:14:01,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:01,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:01,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:01,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:01,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525727456] [2021-08-13 10:14:01,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525727456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:01,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:01,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:14:01,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479160478] [2021-08-13 10:14:01,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:14:01,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:14:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:14:01,805 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-08-13 10:14:01,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 774 transitions, 14697 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:01,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:01,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-08-13 10:14:01,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:02,907 INFO L129 PetriNetUnfolder]: 1301/5389 cut-off events. [2021-08-13 10:14:02,908 INFO L130 PetriNetUnfolder]: For 8732/10158 co-relation queries the response was YES. [2021-08-13 10:14:02,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23338 conditions, 5389 events. 1301/5389 cut-off events. For 8732/10158 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 62918 event pairs, 89 based on Foata normal form. 9/5190 useless extension candidates. Maximal degree in co-relation 23222. Up to 1464 conditions per place. [2021-08-13 10:14:02,950 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 24 selfloop transitions, 17 changer transitions 443/705 dead transitions. [2021-08-13 10:14:02,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 705 transitions, 12655 flow [2021-08-13 10:14:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 10:14:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 10:14:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2021-08-13 10:14:02,952 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9110091743119266 [2021-08-13 10:14:02,952 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2021-08-13 10:14:02,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2021-08-13 10:14:02,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:02,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2021-08-13 10:14:02,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.3) internal successors, (993), 10 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:02,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:02,955 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 109.0) internal successors, (1199), 11 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:02,955 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 131 predicate places. [2021-08-13 10:14:02,955 INFO L482 AbstractCegarLoop]: Abstraction has has 245 places, 705 transitions, 12655 flow [2021-08-13 10:14:02,955 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:02,955 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:02,955 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:14:02,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 10:14:02,956 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -467577176, now seen corresponding path program 1 times [2021-08-13 10:14:02,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:02,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920960175] [2021-08-13 10:14:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:03,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,008 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:14:03,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:14:03,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:14:03,027 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:14:03,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:03,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:03,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:03,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920960175] [2021-08-13 10:14:03,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920960175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:03,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:03,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:14:03,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759442052] [2021-08-13 10:14:03,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:14:03,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:14:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:14:03,037 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-08-13 10:14:03,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 705 transitions, 12655 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:03,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-08-13 10:14:03,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:03,440 INFO L129 PetriNetUnfolder]: 418/1556 cut-off events. [2021-08-13 10:14:03,440 INFO L130 PetriNetUnfolder]: For 1837/4405 co-relation queries the response was YES. [2021-08-13 10:14:03,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1556 events. 418/1556 cut-off events. For 1837/4405 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12765 event pairs, 6 based on Foata normal form. 221/1674 useless extension candidates. Maximal degree in co-relation 5452. Up to 296 conditions per place. [2021-08-13 10:14:03,447 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 22 selfloop transitions, 44 changer transitions 115/297 dead transitions. [2021-08-13 10:14:03,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 297 transitions, 3515 flow [2021-08-13 10:14:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:14:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:14:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1292 transitions. [2021-08-13 10:14:03,449 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9117854622441779 [2021-08-13 10:14:03,449 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1292 transitions. [2021-08-13 10:14:03,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1292 transitions. [2021-08-13 10:14:03,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:03,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1292 transitions. [2021-08-13 10:14:03,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.38461538461539) internal successors, (1292), 13 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,453 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,453 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 107 predicate places. [2021-08-13 10:14:03,453 INFO L482 AbstractCegarLoop]: Abstraction has has 221 places, 297 transitions, 3515 flow [2021-08-13 10:14:03,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,453 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:03,453 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:14:03,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 10:14:03,453 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1680258519, now seen corresponding path program 1 times [2021-08-13 10:14:03,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:03,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398420712] [2021-08-13 10:14:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:03,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,486 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:14:03,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:14:03,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:03,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:03,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:03,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:03,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398420712] [2021-08-13 10:14:03,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398420712] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:03,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:03,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:14:03,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400197313] [2021-08-13 10:14:03,511 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:14:03,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:14:03,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:14:03,511 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 109 [2021-08-13 10:14:03,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 297 transitions, 3515 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:03,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 109 [2021-08-13 10:14:03,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:03,805 INFO L129 PetriNetUnfolder]: 692/2552 cut-off events. [2021-08-13 10:14:03,805 INFO L130 PetriNetUnfolder]: For 3313/4505 co-relation queries the response was YES. [2021-08-13 10:14:03,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9905 conditions, 2552 events. 692/2552 cut-off events. For 3313/4505 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 23797 event pairs, 0 based on Foata normal form. 6/2391 useless extension candidates. Maximal degree in co-relation 9783. Up to 496 conditions per place. [2021-08-13 10:14:03,817 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 21 selfloop transitions, 3 changer transitions 220/406 dead transitions. [2021-08-13 10:14:03,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 406 transitions, 6283 flow [2021-08-13 10:14:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:14:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:14:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 894 transitions. [2021-08-13 10:14:03,818 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2021-08-13 10:14:03,818 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 894 transitions. [2021-08-13 10:14:03,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 894 transitions. [2021-08-13 10:14:03,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:03,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 894 transitions. [2021-08-13 10:14:03,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,820 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,821 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 115 predicate places. [2021-08-13 10:14:03,821 INFO L482 AbstractCegarLoop]: Abstraction has has 229 places, 406 transitions, 6283 flow [2021-08-13 10:14:03,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,821 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:03,821 INFO L266 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] [2021-08-13 10:14:03,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 10:14:03,821 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1333604141, now seen corresponding path program 1 times [2021-08-13 10:14:03,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:03,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220224389] [2021-08-13 10:14:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:03,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:03,868 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:14:03,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:14:03,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:14:03,889 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:14:03,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:03,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:03,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:03,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:03,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220224389] [2021-08-13 10:14:03,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220224389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:03,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:03,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 10:14:03,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391670550] [2021-08-13 10:14:03,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 10:14:03,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 10:14:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 10:14:03,899 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-08-13 10:14:03,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 406 transitions, 6283 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:03,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:03,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-08-13 10:14:03,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:04,287 INFO L129 PetriNetUnfolder]: 540/1528 cut-off events. [2021-08-13 10:14:04,287 INFO L130 PetriNetUnfolder]: For 1345/7009 co-relation queries the response was YES. [2021-08-13 10:14:04,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 1528 events. 540/1528 cut-off events. For 1345/7009 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 12524 event pairs, 0 based on Foata normal form. 366/1753 useless extension candidates. Maximal degree in co-relation 5111. Up to 433 conditions per place. [2021-08-13 10:14:04,295 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 19 selfloop transitions, 48 changer transitions 71/230 dead transitions. [2021-08-13 10:14:04,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 230 transitions, 2031 flow [2021-08-13 10:14:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 10:14:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 10:14:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1576 transitions. [2021-08-13 10:14:04,297 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9036697247706422 [2021-08-13 10:14:04,297 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1576 transitions. [2021-08-13 10:14:04,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1576 transitions. [2021-08-13 10:14:04,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:04,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1576 transitions. [2021-08-13 10:14:04,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.5) internal successors, (1576), 16 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,301 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 109.0) internal successors, (1853), 17 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,302 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 97 predicate places. [2021-08-13 10:14:04,302 INFO L482 AbstractCegarLoop]: Abstraction has has 211 places, 230 transitions, 2031 flow [2021-08-13 10:14:04,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,302 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:04,302 INFO L266 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] [2021-08-13 10:14:04,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 10:14:04,302 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1375433807, now seen corresponding path program 1 times [2021-08-13 10:14:04,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:04,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256875410] [2021-08-13 10:14:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:14:04,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:04,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:04,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:14:04,345 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:14:04,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:14:04,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:04,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:14:04,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:14:04,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:14:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:14:04,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:14:04,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256875410] [2021-08-13 10:14:04,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256875410] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:14:04,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:14:04,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:14:04,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522598608] [2021-08-13 10:14:04,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:14:04,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:14:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:14:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:14:04,371 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-08-13 10:14:04,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 230 transitions, 2031 flow. Second operand has 7 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:14:04,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-08-13 10:14:04,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:14:04,614 INFO L129 PetriNetUnfolder]: 1053/2981 cut-off events. [2021-08-13 10:14:04,614 INFO L130 PetriNetUnfolder]: For 2293/5091 co-relation queries the response was YES. [2021-08-13 10:14:04,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10055 conditions, 2981 events. 1053/2981 cut-off events. For 2293/5091 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 29506 event pairs, 0 based on Foata normal form. 3/2726 useless extension candidates. Maximal degree in co-relation 9926. Up to 846 conditions per place. [2021-08-13 10:14:04,626 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 9 selfloop transitions, 1 changer transitions 107/251 dead transitions. [2021-08-13 10:14:04,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 251 transitions, 2615 flow [2021-08-13 10:14:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 10:14:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 10:14:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2021-08-13 10:14:04,627 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8951507208387942 [2021-08-13 10:14:04,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2021-08-13 10:14:04,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2021-08-13 10:14:04,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:14:04,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2021-08-13 10:14:04,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,630 INFO L348 CegarLoopForPetriNet]: 114 programPoint places, 103 predicate places. [2021-08-13 10:14:04,630 INFO L482 AbstractCegarLoop]: Abstraction has has 217 places, 251 transitions, 2615 flow [2021-08-13 10:14:04,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:14:04,630 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:14:04,630 INFO L266 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] [2021-08-13 10:14:04,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 10:14:04,630 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:14:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:14:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1477247119, now seen corresponding path program 2 times [2021-08-13 10:14:04,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:14:04,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938349930] [2021-08-13 10:14:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:14:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:14:04,652 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:14:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:14:04,674 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:14:04,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 10:14:04,697 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 10:14:04,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-13 10:14:04,700 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 10:14:04,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 10:14:04 BasicIcfg [2021-08-13 10:14:04,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 10:14:04,778 INFO L168 Benchmark]: Toolchain (without parser) took 15052.08 ms. Allocated memory was 181.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 145.4 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 680.7 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 181.4 MB. Free memory is still 163.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.41 ms. Allocated memory is still 181.4 MB. Free memory was 145.2 MB in the beginning and 140.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 181.4 MB. Free memory was 140.2 MB in the beginning and 137.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: Boogie Preprocessor took 23.65 ms. Allocated memory is still 181.4 MB. Free memory was 137.2 MB in the beginning and 135.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: RCFGBuilder took 1327.96 ms. Allocated memory was 181.4 MB in the beginning and 238.0 MB in the end (delta: 56.6 MB). Free memory was 135.1 MB in the beginning and 192.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,778 INFO L168 Benchmark]: TraceAbstraction took 13183.06 ms. Allocated memory was 238.0 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 192.1 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 669.9 MB. Max. memory is 8.0 GB. [2021-08-13 10:14:04,779 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.10 ms. Allocated memory is still 181.4 MB. Free memory is still 163.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 475.41 ms. Allocated memory is still 181.4 MB. Free memory was 145.2 MB in the beginning and 140.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 181.4 MB. Free memory was 140.2 MB in the beginning and 137.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.65 ms. Allocated memory is still 181.4 MB. Free memory was 137.2 MB in the beginning and 135.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1327.96 ms. Allocated memory was 181.4 MB in the beginning and 238.0 MB in the end (delta: 56.6 MB). Free memory was 135.1 MB in the beginning and 192.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13183.06 ms. Allocated memory was 238.0 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 192.1 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 669.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L823] 0 pthread_t t1202; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L825] 0 pthread_t t1203; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L827] 0 pthread_t t1204; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13011.4ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10793.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 41.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 210 SDtfs, 751 SDslu, 804 SDs, 0 SdLazy, 1475 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1173.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1999.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14697occurred in iteration=11, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 43.8ms SsaConstructionTime, 382.2ms SatisfiabilityAnalysisTime, 1532.5ms InterpolantComputationTime, 1293 NumberOfCodeBlocks, 1293 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 5985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! Received shutdown request...