/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-CovSimpl.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 05:01:28,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 05:01:28,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 05:01:28,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 05:01:28,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 05:01:28,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 05:01:28,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 05:01:28,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 05:01:28,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 05:01:28,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 05:01:28,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 05:01:28,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 05:01:28,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 05:01:28,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 05:01:28,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 05:01:28,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 05:01:28,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 05:01:28,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 05:01:28,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 05:01:28,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 05:01:28,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 05:01:28,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 05:01:28,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 05:01:28,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 05:01:28,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 05:01:28,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 05:01:28,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 05:01:28,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 05:01:28,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 05:01:28,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 05:01:28,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 05:01:28,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 05:01:28,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 05:01:28,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 05:01:28,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 05:01:28,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 05:01:28,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 05:01:28,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 05:01:28,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 05:01:28,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 05:01:28,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 05:01:28,562 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-CovSimpl.epf [2021-08-13 05:01:28,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 05:01:28,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 05:01:28,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 05:01:28,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 05:01:28,588 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 05:01:28,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 05:01:28,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 05:01:28,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 05:01:28,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 05:01:28,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 05:01:28,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 05:01:28,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 05:01:28,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 05:01:28,591 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 05:01:28,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 05:01:28,592 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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 05:01:28,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 05:01:28,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 05:01:28,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 05:01:28,888 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 05:01:28,889 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 05:01:28,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-08-13 05:01:28,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac23c2d7/2e2eb8fc88bc46aca96dd12611dc9ce0/FLAG2fab0da5d [2021-08-13 05:01:29,354 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 05:01:29,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-08-13 05:01:29,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac23c2d7/2e2eb8fc88bc46aca96dd12611dc9ce0/FLAG2fab0da5d [2021-08-13 05:01:29,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac23c2d7/2e2eb8fc88bc46aca96dd12611dc9ce0 [2021-08-13 05:01:29,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 05:01:29,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 05:01:29,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 05:01:29,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 05:01:29,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 05:01:29,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:01:29" (1/1) ... [2021-08-13 05:01:29,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6c76a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:29, skipping insertion in model container [2021-08-13 05:01:29,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:01:29" (1/1) ... [2021-08-13 05:01:29,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 05:01:29,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 05:01:29,813 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/mix027_tso.opt.i[948,961] [2021-08-13 05:01:29,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:01:29,949 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 05:01:29,977 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/mix027_tso.opt.i[948,961] [2021-08-13 05:01:30,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:01:30,096 INFO L208 MainTranslator]: Completed translation [2021-08-13 05:01:30,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30 WrapperNode [2021-08-13 05:01:30,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 05:01:30,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 05:01:30,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 05:01:30,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 05:01:30,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 05:01:30,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 05:01:30,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 05:01:30,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 05:01:30,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (1/1) ... [2021-08-13 05:01:30,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 05:01:30,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 05:01:30,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 05:01:30,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 05:01:30,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (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 05:01:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 05:01:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 05:01:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 05:01:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 05:01:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 05:01:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 05:01:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 05:01:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-13 05:01:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 05:01:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 05:01:30,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 05:01:30,374 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 05:01:32,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 05:01:32,098 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 05:01:32,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:01:32 BoogieIcfgContainer [2021-08-13 05:01:32,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 05:01:32,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 05:01:32,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 05:01:32,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 05:01:32,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 05:01:29" (1/3) ... [2021-08-13 05:01:32,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ff6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:01:32, skipping insertion in model container [2021-08-13 05:01:32,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:01:30" (2/3) ... [2021-08-13 05:01:32,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ff6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:01:32, skipping insertion in model container [2021-08-13 05:01:32,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:01:32" (3/3) ... [2021-08-13 05:01:32,105 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2021-08-13 05:01:32,109 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 05:01:32,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 05:01:32,110 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 05:01:32,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,179 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,202 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,204 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:01:32,207 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 05:01:32,239 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-13 05:01:32,252 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 05:01:32,252 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 05:01:32,261 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 05:01:32,261 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 05:01:32,261 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 05:01:32,261 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 05:01:32,261 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 05:01:32,261 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 05:01:32,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-08-13 05:01:32,337 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-08-13 05:01:32,338 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:01:32,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2021-08-13 05:01:32,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-08-13 05:01:32,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2021-08-13 05:01:32,362 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-08-13 05:01:32,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:01:32,362 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:32,363 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] [2021-08-13 05:01:32,364 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1619171300, now seen corresponding path program 1 times [2021-08-13 05:01:32,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:32,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399452987] [2021-08-13 05:01:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:32,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:32,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:32,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:32,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:32,636 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 05:01:32,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:32,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399452987] [2021-08-13 05:01:32,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399452987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:32,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:32,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 05:01:32,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293847265] [2021-08-13 05:01:32,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 05:01:32,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 05:01:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 05:01:32,657 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2021-08-13 05:01:32,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 05:01:32,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:32,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2021-08-13 05:01:32,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:32,880 INFO L129 PetriNetUnfolder]: 133/824 cut-off events. [2021-08-13 05:01:32,880 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:01:32,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 824 events. 133/824 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5509 event pairs, 87 based on Foata normal form. 36/809 useless extension candidates. Maximal degree in co-relation 990. Up to 153 conditions per place. [2021-08-13 05:01:32,887 INFO L132 encePairwiseOnDemand]: 124/129 looper letters, 11 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2021-08-13 05:01:32,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 290 flow [2021-08-13 05:01:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 05:01:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 05:01:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-08-13 05:01:32,898 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9534883720930233 [2021-08-13 05:01:32,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-08-13 05:01:32,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-08-13 05:01:32,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:32,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-08-13 05:01:32,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 05:01:32,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 05:01:32,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 05:01:32,914 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2021-08-13 05:01:32,914 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 126 transitions, 290 flow [2021-08-13 05:01:32,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 05:01:32,915 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:32,915 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] [2021-08-13 05:01:32,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 05:01:32,919 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash -272929157, now seen corresponding path program 1 times [2021-08-13 05:01:32,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:32,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856337069] [2021-08-13 05:01:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:33,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:33,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:33,114 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:33,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:33,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:33,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:33,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:33,150 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 05:01:33,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:33,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856337069] [2021-08-13 05:01:33,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856337069] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:33,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:33,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:01:33,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595152220] [2021-08-13 05:01:33,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:01:33,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:01:33,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:01:33,157 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-13 05:01:33,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 126 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:33,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:33,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-13 05:01:33,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:33,552 INFO L129 PetriNetUnfolder]: 672/2739 cut-off events. [2021-08-13 05:01:33,553 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-08-13 05:01:33,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 2739 events. 672/2739 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 26543 event pairs, 272 based on Foata normal form. 0/2599 useless extension candidates. Maximal degree in co-relation 4079. Up to 651 conditions per place. [2021-08-13 05:01:33,571 INFO L132 encePairwiseOnDemand]: 122/129 looper letters, 11 selfloop transitions, 3 changer transitions 25/153 dead transitions. [2021-08-13 05:01:33,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 153 transitions, 426 flow [2021-08-13 05:01:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 05:01:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 05:01:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2021-08-13 05:01:33,574 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9250645994832042 [2021-08-13 05:01:33,574 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2021-08-13 05:01:33,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2021-08-13 05:01:33,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:33,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2021-08-13 05:01:33,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 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 05:01:33,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:33,580 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:33,581 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2021-08-13 05:01:33,581 INFO L482 AbstractCegarLoop]: Abstraction has has 144 places, 153 transitions, 426 flow [2021-08-13 05:01:33,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:33,581 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:33,582 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 05:01:33,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 05:01:33,582 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash 105156156, now seen corresponding path program 1 times [2021-08-13 05:01:33,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:33,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500337410] [2021-08-13 05:01:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:33,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:33,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:33,648 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:33,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:33,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:33,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:33,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:33,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:33,674 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 05:01:33,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:33,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500337410] [2021-08-13 05:01:33,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500337410] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:33,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:33,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:01:33,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622541132] [2021-08-13 05:01:33,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:01:33,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:01:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:01:33,676 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2021-08-13 05:01:33,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 153 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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 05:01:33,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:33,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2021-08-13 05:01:33,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:34,238 INFO L129 PetriNetUnfolder]: 789/3456 cut-off events. [2021-08-13 05:01:34,238 INFO L130 PetriNetUnfolder]: For 207/297 co-relation queries the response was YES. [2021-08-13 05:01:34,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 3456 events. 789/3456 cut-off events. For 207/297 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 36419 event pairs, 203 based on Foata normal form. 6/3346 useless extension candidates. Maximal degree in co-relation 5815. Up to 729 conditions per place. [2021-08-13 05:01:34,259 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 8 selfloop transitions, 2 changer transitions 42/170 dead transitions. [2021-08-13 05:01:34,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 170 transitions, 578 flow [2021-08-13 05:01:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 05:01:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 05:01:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2021-08-13 05:01:34,261 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9267872523686477 [2021-08-13 05:01:34,262 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1076 transitions. [2021-08-13 05:01:34,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1076 transitions. [2021-08-13 05:01:34,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:34,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1076 transitions. [2021-08-13 05:01:34,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 0 states have call successors, (0), 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 05:01:34,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:34,266 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:34,266 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 16 predicate places. [2021-08-13 05:01:34,266 INFO L482 AbstractCegarLoop]: Abstraction has has 152 places, 170 transitions, 578 flow [2021-08-13 05:01:34,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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 05:01:34,267 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:34,267 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] [2021-08-13 05:01:34,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 05:01:34,267 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash -214969216, now seen corresponding path program 1 times [2021-08-13 05:01:34,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:34,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406986105] [2021-08-13 05:01:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:34,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:34,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:34,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:01:34,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:01:34,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:01:34,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 05:01:34,397 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 05:01:34,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 05:01:34,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:34,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:34,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:34,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:34,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:34,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:34,513 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 05:01:34,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:34,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406986105] [2021-08-13 05:01:34,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406986105] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:34,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:34,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 05:01:34,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80450515] [2021-08-13 05:01:34,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 05:01:34,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 05:01:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-13 05:01:34,516 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2021-08-13 05:01:34,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 170 transitions, 578 flow. Second operand has 11 states, 11 states have (on average 107.0909090909091) internal successors, (1178), 11 states have internal predecessors, (1178), 0 states have call successors, (0), 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 05:01:34,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:34,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2021-08-13 05:01:34,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:36,534 INFO L129 PetriNetUnfolder]: 5722/14491 cut-off events. [2021-08-13 05:01:36,534 INFO L130 PetriNetUnfolder]: For 4815/5925 co-relation queries the response was YES. [2021-08-13 05:01:36,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31417 conditions, 14491 events. 5722/14491 cut-off events. For 4815/5925 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 160530 event pairs, 1212 based on Foata normal form. 8/14290 useless extension candidates. Maximal degree in co-relation 31351. Up to 3276 conditions per place. [2021-08-13 05:01:36,633 INFO L132 encePairwiseOnDemand]: 115/129 looper letters, 20 selfloop transitions, 13 changer transitions 183/309 dead transitions. [2021-08-13 05:01:36,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 309 transitions, 1654 flow [2021-08-13 05:01:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 05:01:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 05:01:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1784 transitions. [2021-08-13 05:01:36,636 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8643410852713178 [2021-08-13 05:01:36,637 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1784 transitions. [2021-08-13 05:01:36,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1784 transitions. [2021-08-13 05:01:36,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:36,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1784 transitions. [2021-08-13 05:01:36,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 111.5) internal successors, (1784), 16 states have internal predecessors, (1784), 0 states have call successors, (0), 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 05:01:36,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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 05:01:36,643 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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 05:01:36,643 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 31 predicate places. [2021-08-13 05:01:36,643 INFO L482 AbstractCegarLoop]: Abstraction has has 167 places, 309 transitions, 1654 flow [2021-08-13 05:01:36,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 107.0909090909091) internal successors, (1178), 11 states have internal predecessors, (1178), 0 states have call successors, (0), 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 05:01:36,643 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:36,644 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] [2021-08-13 05:01:36,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 05:01:36,644 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1044593849, now seen corresponding path program 1 times [2021-08-13 05:01:36,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:36,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4351496] [2021-08-13 05:01:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:36,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:36,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:36,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:01:36,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:01:36,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:01:36,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:01:36,726 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:36,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:36,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:36,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:36,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:36,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:36,754 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 05:01:36,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:36,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4351496] [2021-08-13 05:01:36,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4351496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:36,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:36,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 05:01:36,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437399253] [2021-08-13 05:01:36,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 05:01:36,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 05:01:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 05:01:36,757 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 129 [2021-08-13 05:01:36,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 309 transitions, 1654 flow. Second operand has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 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 05:01:36,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:36,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 129 [2021-08-13 05:01:36,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:39,675 INFO L129 PetriNetUnfolder]: 8233/21866 cut-off events. [2021-08-13 05:01:39,676 INFO L130 PetriNetUnfolder]: For 8980/13277 co-relation queries the response was YES. [2021-08-13 05:01:39,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56504 conditions, 21866 events. 8233/21866 cut-off events. For 8980/13277 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 265473 event pairs, 1404 based on Foata normal form. 117/21700 useless extension candidates. Maximal degree in co-relation 56433. Up to 5354 conditions per place. [2021-08-13 05:01:39,794 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 28 selfloop transitions, 18 changer transitions 415/556 dead transitions. [2021-08-13 05:01:39,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 556 transitions, 4228 flow [2021-08-13 05:01:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 05:01:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 05:01:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1598 transitions. [2021-08-13 05:01:39,798 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.884828349944629 [2021-08-13 05:01:39,798 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1598 transitions. [2021-08-13 05:01:39,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1598 transitions. [2021-08-13 05:01:39,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:39,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1598 transitions. [2021-08-13 05:01:39,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.14285714285714) internal successors, (1598), 14 states have internal predecessors, (1598), 0 states have call successors, (0), 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 05:01:39,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:01:39,804 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:01:39,804 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 44 predicate places. [2021-08-13 05:01:39,804 INFO L482 AbstractCegarLoop]: Abstraction has has 180 places, 556 transitions, 4228 flow [2021-08-13 05:01:39,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 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 05:01:39,805 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:39,805 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 05:01:39,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 05:01:39,805 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2040485647, now seen corresponding path program 1 times [2021-08-13 05:01:39,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:39,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216602428] [2021-08-13 05:01:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:39,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:39,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:39,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:39,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:39,871 INFO L142 QuantifierPusher]: treesize reduction 10, result has 79.2 percent of original size [2021-08-13 05:01:39,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-08-13 05:01:39,875 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 05:01:39,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 05:01:39,885 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:39,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:39,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:39,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:39,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:39,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:39,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:39,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:39,931 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 05:01:39,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:39,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216602428] [2021-08-13 05:01:39,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216602428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:39,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:39,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:01:39,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806756881] [2021-08-13 05:01:39,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:01:39,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:01:39,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:01:39,933 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 129 [2021-08-13 05:01:39,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 556 transitions, 4228 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 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 05:01:39,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:39,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 129 [2021-08-13 05:01:39,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:43,669 INFO L129 PetriNetUnfolder]: 10239/27258 cut-off events. [2021-08-13 05:01:43,670 INFO L130 PetriNetUnfolder]: For 13970/23038 co-relation queries the response was YES. [2021-08-13 05:01:43,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83579 conditions, 27258 events. 10239/27258 cut-off events. For 13970/23038 co-relation queries the response was YES. Maximal size of possible extension queue 1734. Compared 342610 event pairs, 1101 based on Foata normal form. 247/27203 useless extension candidates. Maximal degree in co-relation 83504. Up to 8322 conditions per place. [2021-08-13 05:01:43,888 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 43 selfloop transitions, 11 changer transitions 643/793 dead transitions. [2021-08-13 05:01:43,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 793 transitions, 7810 flow [2021-08-13 05:01:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:01:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:01:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1505 transitions. [2021-08-13 05:01:43,893 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2021-08-13 05:01:43,893 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1505 transitions. [2021-08-13 05:01:43,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1505 transitions. [2021-08-13 05:01:43,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:43,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1505 transitions. [2021-08-13 05:01:43,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.76923076923077) internal successors, (1505), 13 states have internal predecessors, (1505), 0 states have call successors, (0), 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 05:01:43,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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 05:01:43,900 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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 05:01:43,900 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 56 predicate places. [2021-08-13 05:01:43,901 INFO L482 AbstractCegarLoop]: Abstraction has has 192 places, 793 transitions, 7810 flow [2021-08-13 05:01:43,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 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 05:01:43,901 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:43,901 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 05:01:43,901 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 05:01:43,902 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1486361645, now seen corresponding path program 2 times [2021-08-13 05:01:43,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:43,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956029331] [2021-08-13 05:01:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:43,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:43,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:43,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:43,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:43,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:43,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:01:43,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:43,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:01:43,997 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 05:01:43,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 05:01:44,010 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:44,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:44,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:44,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:44,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:44,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:44,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:44,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:44,044 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 05:01:44,045 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:44,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956029331] [2021-08-13 05:01:44,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956029331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:44,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:44,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 05:01:44,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729614278] [2021-08-13 05:01:44,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 05:01:44,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 05:01:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 05:01:44,047 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 129 [2021-08-13 05:01:44,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 793 transitions, 7810 flow. Second operand has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 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 05:01:44,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:44,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 129 [2021-08-13 05:01:44,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:49,459 INFO L129 PetriNetUnfolder]: 11878/31757 cut-off events. [2021-08-13 05:01:49,459 INFO L130 PetriNetUnfolder]: For 19358/31027 co-relation queries the response was YES. [2021-08-13 05:01:49,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111588 conditions, 31757 events. 11878/31757 cut-off events. For 19358/31027 co-relation queries the response was YES. Maximal size of possible extension queue 2025. Compared 408653 event pairs, 1111 based on Foata normal form. 430/31856 useless extension candidates. Maximal degree in co-relation 111508. Up to 9874 conditions per place. [2021-08-13 05:01:49,669 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 44 selfloop transitions, 15 changer transitions 754/908 dead transitions. [2021-08-13 05:01:49,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 908 transitions, 10684 flow [2021-08-13 05:01:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 05:01:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 05:01:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1601 transitions. [2021-08-13 05:01:49,688 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8864894795127354 [2021-08-13 05:01:49,688 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1601 transitions. [2021-08-13 05:01:49,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1601 transitions. [2021-08-13 05:01:49,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:49,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1601 transitions. [2021-08-13 05:01:49,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.35714285714286) internal successors, (1601), 14 states have internal predecessors, (1601), 0 states have call successors, (0), 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 05:01:49,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:01:49,695 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:01:49,695 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 69 predicate places. [2021-08-13 05:01:49,695 INFO L482 AbstractCegarLoop]: Abstraction has has 205 places, 908 transitions, 10684 flow [2021-08-13 05:01:49,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 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 05:01:49,695 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:49,695 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, 1] [2021-08-13 05:01:49,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 05:01:49,696 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1851153184, now seen corresponding path program 1 times [2021-08-13 05:01:49,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:49,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207108383] [2021-08-13 05:01:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:49,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:49,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:49,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:01:49,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:01:49,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:01:49,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 05:01:49,859 INFO L142 QuantifierPusher]: treesize reduction 12, result has 87.6 percent of original size [2021-08-13 05:01:49,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 85 [2021-08-13 05:01:49,871 INFO L142 QuantifierPusher]: treesize reduction 12, result has 88.0 percent of original size [2021-08-13 05:01:49,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-08-13 05:01:49,901 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 05:01:49,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 05:01:49,920 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:01:49,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:01:49,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:49,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:49,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:49,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:49,954 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 05:01:49,954 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:49,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207108383] [2021-08-13 05:01:49,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207108383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:49,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:49,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 05:01:49,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494695267] [2021-08-13 05:01:49,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 05:01:49,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 05:01:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-13 05:01:49,959 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2021-08-13 05:01:49,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 908 transitions, 10684 flow. Second operand has 12 states, 12 states have (on average 106.25) internal successors, (1275), 12 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:49,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:49,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2021-08-13 05:01:49,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:01:56,739 INFO L129 PetriNetUnfolder]: 14824/39643 cut-off events. [2021-08-13 05:01:56,740 INFO L130 PetriNetUnfolder]: For 28666/48213 co-relation queries the response was YES. [2021-08-13 05:01:57,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157439 conditions, 39643 events. 14824/39643 cut-off events. For 28666/48213 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 525391 event pairs, 952 based on Foata normal form. 512/39812 useless extension candidates. Maximal degree in co-relation 157351. Up to 13034 conditions per place. [2021-08-13 05:01:57,205 INFO L132 encePairwiseOnDemand]: 115/129 looper letters, 47 selfloop transitions, 15 changer transitions 977/1131 dead transitions. [2021-08-13 05:01:57,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1131 transitions, 15654 flow [2021-08-13 05:01:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 05:01:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 05:01:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1990 transitions. [2021-08-13 05:01:57,209 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8570198105081827 [2021-08-13 05:01:57,209 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1990 transitions. [2021-08-13 05:01:57,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1990 transitions. [2021-08-13 05:01:57,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:01:57,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1990 transitions. [2021-08-13 05:01:57,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 110.55555555555556) internal successors, (1990), 18 states have internal predecessors, (1990), 0 states have call successors, (0), 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 05:01:57,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 129.0) internal successors, (2451), 19 states have internal predecessors, (2451), 0 states have call successors, (0), 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 05:01:57,215 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 129.0) internal successors, (2451), 19 states have internal predecessors, (2451), 0 states have call successors, (0), 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 05:01:57,216 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 86 predicate places. [2021-08-13 05:01:57,216 INFO L482 AbstractCegarLoop]: Abstraction has has 222 places, 1131 transitions, 15654 flow [2021-08-13 05:01:57,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 106.25) internal successors, (1275), 12 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:01:57,216 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:01:57,216 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, 1] [2021-08-13 05:01:57,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 05:01:57,216 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:01:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:01:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 821841251, now seen corresponding path program 1 times [2021-08-13 05:01:57,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:01:57,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031838798] [2021-08-13 05:01:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:01:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:01:57,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:57,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:57,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:57,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:01:57,257 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:01:57,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:01:57,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:57,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:01:57,273 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:01:57,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:01:57,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:01:57,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:01:57,279 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 05:01:57,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:01:57,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031838798] [2021-08-13 05:01:57,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031838798] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:01:57,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:01:57,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:01:57,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596050370] [2021-08-13 05:01:57,280 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:01:57,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:01:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:01:57,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:01:57,281 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 05:01:57,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1131 transitions, 15654 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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 05:01:57,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:01:57,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 05:01:57,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:01,607 INFO L129 PetriNetUnfolder]: 7906/23262 cut-off events. [2021-08-13 05:02:01,608 INFO L130 PetriNetUnfolder]: For 15881/22545 co-relation queries the response was YES. [2021-08-13 05:02:01,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84878 conditions, 23262 events. 7906/23262 cut-off events. For 15881/22545 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 298264 event pairs, 1131 based on Foata normal form. 24/22536 useless extension candidates. Maximal degree in co-relation 84787. Up to 8904 conditions per place. [2021-08-13 05:02:02,045 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 29 selfloop transitions, 20 changer transitions 153/697 dead transitions. [2021-08-13 05:02:02,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 697 transitions, 8576 flow [2021-08-13 05:02:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 05:02:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 05:02:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2021-08-13 05:02:02,074 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9232558139534883 [2021-08-13 05:02:02,074 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2021-08-13 05:02:02,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2021-08-13 05:02:02,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:02,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2021-08-13 05:02:02,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 0 states have call successors, (0), 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 05:02:02,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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 05:02:02,080 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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 05:02:02,080 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 86 predicate places. [2021-08-13 05:02:02,080 INFO L482 AbstractCegarLoop]: Abstraction has has 222 places, 697 transitions, 8576 flow [2021-08-13 05:02:02,081 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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 05:02:02,081 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:02,081 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, 1, 1] [2021-08-13 05:02:02,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 05:02:02,081 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1969672449, now seen corresponding path program 1 times [2021-08-13 05:02:02,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:02,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76632990] [2021-08-13 05:02:02,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:02,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:02,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:02,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:02,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:02,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:02,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:02,199 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:02:02,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:02:02,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:02,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:02,216 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:02:02,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:02,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:02,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:02,224 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 05:02:02,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:02,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76632990] [2021-08-13 05:02:02,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76632990] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:02,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:02,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:02:02,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746960664] [2021-08-13 05:02:02,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:02:02,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:02:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:02:02,225 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 05:02:02,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 697 transitions, 8576 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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 05:02:02,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:02,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 05:02:02,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:03,486 INFO L129 PetriNetUnfolder]: 2444/7363 cut-off events. [2021-08-13 05:02:03,486 INFO L130 PetriNetUnfolder]: For 5877/13830 co-relation queries the response was YES. [2021-08-13 05:02:03,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24597 conditions, 7363 events. 2444/7363 cut-off events. For 5877/13830 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 77034 event pairs, 223 based on Foata normal form. 595/7552 useless extension candidates. Maximal degree in co-relation 24503. Up to 1772 conditions per place. [2021-08-13 05:02:03,545 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 52 selfloop transitions, 54 changer transitions 185/499 dead transitions. [2021-08-13 05:02:03,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 499 transitions, 5126 flow [2021-08-13 05:02:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:02:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:02:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1550 transitions. [2021-08-13 05:02:03,548 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9242695289206917 [2021-08-13 05:02:03,548 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1550 transitions. [2021-08-13 05:02:03,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1550 transitions. [2021-08-13 05:02:03,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:03,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1550 transitions. [2021-08-13 05:02:03,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.23076923076923) internal successors, (1550), 13 states have internal predecessors, (1550), 0 states have call successors, (0), 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 05:02:03,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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 05:02:03,553 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 0 states have call successors, (0), 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 05:02:03,553 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 98 predicate places. [2021-08-13 05:02:03,553 INFO L482 AbstractCegarLoop]: Abstraction has has 234 places, 499 transitions, 5126 flow [2021-08-13 05:02:03,553 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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 05:02:03,553 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:03,554 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, 1, 1, 1, 1, 1] [2021-08-13 05:02:03,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 05:02:03,554 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:03,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1178521669, now seen corresponding path program 1 times [2021-08-13 05:02:03,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:03,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234119762] [2021-08-13 05:02:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:03,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:03,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:03,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:03,609 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:02:03,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:02:03,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:03,628 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:02:03,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:03,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:03,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:03,636 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 05:02:03,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:03,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234119762] [2021-08-13 05:02:03,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234119762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:03,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:03,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 05:02:03,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080178500] [2021-08-13 05:02:03,636 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 05:02:03,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 05:02:03,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 05:02:03,638 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 05:02:03,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 499 transitions, 5126 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 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 05:02:03,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:03,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 05:02:03,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:04,443 INFO L129 PetriNetUnfolder]: 1490/4187 cut-off events. [2021-08-13 05:02:04,443 INFO L130 PetriNetUnfolder]: For 2802/14079 co-relation queries the response was YES. [2021-08-13 05:02:04,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13996 conditions, 4187 events. 1490/4187 cut-off events. For 2802/14079 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40183 event pairs, 23 based on Foata normal form. 780/4670 useless extension candidates. Maximal degree in co-relation 13899. Up to 1097 conditions per place. [2021-08-13 05:02:04,476 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 33 selfloop transitions, 106 changer transitions 76/355 dead transitions. [2021-08-13 05:02:04,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 355 transitions, 2810 flow [2021-08-13 05:02:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 05:02:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 05:02:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1909 transitions. [2021-08-13 05:02:04,479 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9249031007751938 [2021-08-13 05:02:04,479 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1909 transitions. [2021-08-13 05:02:04,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1909 transitions. [2021-08-13 05:02:04,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:04,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1909 transitions. [2021-08-13 05:02:04,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.3125) internal successors, (1909), 16 states have internal predecessors, (1909), 0 states have call successors, (0), 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 05:02:04,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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 05:02:04,484 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 0 states have call successors, (0), 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 05:02:04,484 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 80 predicate places. [2021-08-13 05:02:04,484 INFO L482 AbstractCegarLoop]: Abstraction has has 216 places, 355 transitions, 2810 flow [2021-08-13 05:02:04,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 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 05:02:04,484 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:04,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:04,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 05:02:04,485 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 874784659, now seen corresponding path program 1 times [2021-08-13 05:02:04,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:04,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808930698] [2021-08-13 05:02:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:04,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:04,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:04,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:04,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:02:04,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:02:04,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 05:02:04,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:04,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 05:02:04,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 05:02:04,586 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:02:04,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:02:04,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:04,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:04,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:04,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:04,617 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 05:02:04,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:04,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808930698] [2021-08-13 05:02:04,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808930698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:04,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:04,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 05:02:04,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242921930] [2021-08-13 05:02:04,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 05:02:04,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 05:02:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-13 05:02:04,619 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2021-08-13 05:02:04,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 355 transitions, 2810 flow. Second operand has 13 states, 13 states have (on average 104.53846153846153) internal successors, (1359), 13 states have internal predecessors, (1359), 0 states have call successors, (0), 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 05:02:04,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:04,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2021-08-13 05:02:04,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:06,099 INFO L129 PetriNetUnfolder]: 3722/10125 cut-off events. [2021-08-13 05:02:06,100 INFO L130 PetriNetUnfolder]: For 8852/18228 co-relation queries the response was YES. [2021-08-13 05:02:06,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 10125 events. 3722/10125 cut-off events. For 8852/18228 co-relation queries the response was YES. Maximal size of possible extension queue 1246. Compared 116533 event pairs, 28 based on Foata normal form. 63/9414 useless extension candidates. Maximal degree in co-relation 35273. Up to 2685 conditions per place. [2021-08-13 05:02:06,206 INFO L132 encePairwiseOnDemand]: 113/129 looper letters, 90 selfloop transitions, 43 changer transitions 125/486 dead transitions. [2021-08-13 05:02:06,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 486 transitions, 5054 flow [2021-08-13 05:02:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 05:02:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 05:02:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2074 transitions. [2021-08-13 05:02:06,209 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8461852305181559 [2021-08-13 05:02:06,209 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2074 transitions. [2021-08-13 05:02:06,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2074 transitions. [2021-08-13 05:02:06,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:06,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2074 transitions. [2021-08-13 05:02:06,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 109.15789473684211) internal successors, (2074), 19 states have internal predecessors, (2074), 0 states have call successors, (0), 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 05:02:06,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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 05:02:06,214 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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 05:02:06,214 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 98 predicate places. [2021-08-13 05:02:06,214 INFO L482 AbstractCegarLoop]: Abstraction has has 234 places, 486 transitions, 5054 flow [2021-08-13 05:02:06,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 104.53846153846153) internal successors, (1359), 13 states have internal predecessors, (1359), 0 states have call successors, (0), 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 05:02:06,215 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:06,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:06,215 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 05:02:06,215 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1383234631, now seen corresponding path program 2 times [2021-08-13 05:02:06,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:06,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442701931] [2021-08-13 05:02:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:06,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:06,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:06,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:06,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:06,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:06,279 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:02:06,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:02:06,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:06,298 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:02:06,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:06,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:06,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:06,306 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 05:02:06,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:06,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442701931] [2021-08-13 05:02:06,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442701931] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:06,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:06,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 05:02:06,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271559908] [2021-08-13 05:02:06,307 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 05:02:06,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 05:02:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-13 05:02:06,308 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 05:02:06,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 486 transitions, 5054 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 0 states have call successors, (0), 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 05:02:06,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:06,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 05:02:06,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:08,078 INFO L129 PetriNetUnfolder]: 3573/9295 cut-off events. [2021-08-13 05:02:08,078 INFO L130 PetriNetUnfolder]: For 11113/44099 co-relation queries the response was YES. [2021-08-13 05:02:08,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38386 conditions, 9295 events. 3573/9295 cut-off events. For 11113/44099 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 108108 event pairs, 9 based on Foata normal form. 2025/10586 useless extension candidates. Maximal degree in co-relation 38278. Up to 2641 conditions per place. [2021-08-13 05:02:08,197 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 28 selfloop transitions, 111 changer transitions 91/424 dead transitions. [2021-08-13 05:02:08,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 424 transitions, 4174 flow [2021-08-13 05:02:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 05:02:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 05:02:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2248 transitions. [2021-08-13 05:02:08,216 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9171766625866993 [2021-08-13 05:02:08,216 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2248 transitions. [2021-08-13 05:02:08,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2248 transitions. [2021-08-13 05:02:08,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:08,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2248 transitions. [2021-08-13 05:02:08,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.3157894736842) internal successors, (2248), 19 states have internal predecessors, (2248), 0 states have call successors, (0), 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 05:02:08,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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 05:02:08,221 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 0 states have call successors, (0), 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 05:02:08,221 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 98 predicate places. [2021-08-13 05:02:08,221 INFO L482 AbstractCegarLoop]: Abstraction has has 234 places, 424 transitions, 4174 flow [2021-08-13 05:02:08,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 0 states have call successors, (0), 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 05:02:08,221 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:08,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:08,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 05:02:08,222 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1334984864, now seen corresponding path program 1 times [2021-08-13 05:02:08,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:08,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277428679] [2021-08-13 05:02:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:08,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:08,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:08,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:08,386 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:02:08,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:02:08,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:08,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:08,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:08,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:08,430 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 05:02:08,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:08,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277428679] [2021-08-13 05:02:08,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277428679] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:08,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:08,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:02:08,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061191301] [2021-08-13 05:02:08,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:02:08,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:02:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:02:08,432 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-13 05:02:08,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 424 transitions, 4174 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 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 05:02:08,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:08,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-13 05:02:08,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:10,346 INFO L129 PetriNetUnfolder]: 6074/15378 cut-off events. [2021-08-13 05:02:10,346 INFO L130 PetriNetUnfolder]: For 18293/40363 co-relation queries the response was YES. [2021-08-13 05:02:10,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63566 conditions, 15378 events. 6074/15378 cut-off events. For 18293/40363 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 190908 event pairs, 17 based on Foata normal form. 31/14134 useless extension candidates. Maximal degree in co-relation 63454. Up to 4509 conditions per place. [2021-08-13 05:02:10,490 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 9 selfloop transitions, 2 changer transitions 103/435 dead transitions. [2021-08-13 05:02:10,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 435 transitions, 4414 flow [2021-08-13 05:02:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 05:02:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 05:02:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2021-08-13 05:02:10,509 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9114064230343301 [2021-08-13 05:02:10,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2021-08-13 05:02:10,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2021-08-13 05:02:10,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:10,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2021-08-13 05:02:10,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 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 05:02:10,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:02:10,511 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 05:02:10,511 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 104 predicate places. [2021-08-13 05:02:10,511 INFO L482 AbstractCegarLoop]: Abstraction has has 240 places, 435 transitions, 4414 flow [2021-08-13 05:02:10,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 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 05:02:10,511 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:10,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:10,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 05:02:10,512 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1172419208, now seen corresponding path program 2 times [2021-08-13 05:02:10,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:10,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48841035] [2021-08-13 05:02:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:10,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:10,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:10,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:10,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:10,725 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:02:10,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:02:10,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:10,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:10,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:10,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:10,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:10,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:10,751 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 05:02:10,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:10,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48841035] [2021-08-13 05:02:10,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48841035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:10,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:10,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:02:10,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210445792] [2021-08-13 05:02:10,751 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:02:10,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:02:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:02:10,753 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-13 05:02:10,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 435 transitions, 4414 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 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 05:02:10,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:10,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-13 05:02:10,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:14,216 INFO L129 PetriNetUnfolder]: 10582/26064 cut-off events. [2021-08-13 05:02:14,217 INFO L130 PetriNetUnfolder]: For 29939/64452 co-relation queries the response was YES. [2021-08-13 05:02:14,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108400 conditions, 26064 events. 10582/26064 cut-off events. For 29939/64452 co-relation queries the response was YES. Maximal size of possible extension queue 3570. Compared 342590 event pairs, 36 based on Foata normal form. 68/24040 useless extension candidates. Maximal degree in co-relation 108285. Up to 7898 conditions per place. [2021-08-13 05:02:14,491 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 10 selfloop transitions, 3 changer transitions 124/456 dead transitions. [2021-08-13 05:02:14,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 456 transitions, 4926 flow [2021-08-13 05:02:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-13 05:02:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-08-13 05:02:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2021-08-13 05:02:14,492 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9160206718346253 [2021-08-13 05:02:14,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2021-08-13 05:02:14,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2021-08-13 05:02:14,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:14,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2021-08-13 05:02:14,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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 05:02:14,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 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 05:02:14,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 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 05:02:14,494 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 109 predicate places. [2021-08-13 05:02:14,495 INFO L482 AbstractCegarLoop]: Abstraction has has 245 places, 456 transitions, 4926 flow [2021-08-13 05:02:14,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 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 05:02:14,495 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:14,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:14,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 05:02:14,495 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash 99307848, now seen corresponding path program 3 times [2021-08-13 05:02:14,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:14,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182020986] [2021-08-13 05:02:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:14,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:14,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:14,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:14,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:02:14,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 05:02:14,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-08-13 05:02:14,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-13 05:02:14,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 05:02:14,626 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.2 percent of original size [2021-08-13 05:02:14,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-08-13 05:02:14,634 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:02:14,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:02:14,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:14,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:14,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:14,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:14,666 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 05:02:14,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:14,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182020986] [2021-08-13 05:02:14,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182020986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:14,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:14,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 05:02:14,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732862022] [2021-08-13 05:02:14,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 05:02:14,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 05:02:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-13 05:02:14,669 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2021-08-13 05:02:14,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 456 transitions, 4926 flow. Second operand has 12 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 0 states have call successors, (0), 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 05:02:14,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:14,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2021-08-13 05:02:14,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:20,504 INFO L129 PetriNetUnfolder]: 16245/38402 cut-off events. [2021-08-13 05:02:20,505 INFO L130 PetriNetUnfolder]: For 44503/103477 co-relation queries the response was YES. [2021-08-13 05:02:20,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162995 conditions, 38402 events. 16245/38402 cut-off events. For 44503/103477 co-relation queries the response was YES. Maximal size of possible extension queue 5105. Compared 517975 event pairs, 55 based on Foata normal form. 192/35690 useless extension candidates. Maximal degree in co-relation 162870. Up to 12302 conditions per place. [2021-08-13 05:02:20,927 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 90 selfloop transitions, 25 changer transitions 166/506 dead transitions. [2021-08-13 05:02:20,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 506 transitions, 6376 flow [2021-08-13 05:02:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 05:02:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 05:02:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1067 transitions. [2021-08-13 05:02:20,929 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8271317829457364 [2021-08-13 05:02:20,929 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1067 transitions. [2021-08-13 05:02:20,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1067 transitions. [2021-08-13 05:02:20,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:20,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1067 transitions. [2021-08-13 05:02:20,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.7) internal successors, (1067), 10 states have internal predecessors, (1067), 0 states have call successors, (0), 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 05:02:20,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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 05:02:20,932 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 0 states have call successors, (0), 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 05:02:20,932 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 118 predicate places. [2021-08-13 05:02:20,932 INFO L482 AbstractCegarLoop]: Abstraction has has 254 places, 506 transitions, 6376 flow [2021-08-13 05:02:20,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 0 states have call successors, (0), 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 05:02:20,932 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:20,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:20,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 05:02:20,932 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1496684206, now seen corresponding path program 4 times [2021-08-13 05:02:20,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:20,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190881434] [2021-08-13 05:02:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:02:21,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:21,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:02:21,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:02:21,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:02:21,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:02:21,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 05:02:21,036 INFO L142 QuantifierPusher]: treesize reduction 14, result has 84.9 percent of original size [2021-08-13 05:02:21,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-08-13 05:02:21,079 INFO L142 QuantifierPusher]: treesize reduction 6, result has 93.0 percent of original size [2021-08-13 05:02:21,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-08-13 05:02:21,113 INFO L142 QuantifierPusher]: treesize reduction 6, result has 93.3 percent of original size [2021-08-13 05:02:21,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-08-13 05:02:21,164 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.7 percent of original size [2021-08-13 05:02:21,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-08-13 05:02:21,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-13 05:02:21,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 05:02:21,361 INFO L142 QuantifierPusher]: treesize reduction 14, result has 76.3 percent of original size [2021-08-13 05:02:21,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-08-13 05:02:21,369 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:02:21,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:02:21,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:21,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:02:21,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:02:21,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:02:21,414 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 05:02:21,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:02:21,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190881434] [2021-08-13 05:02:21,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190881434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:02:21,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:02:21,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-13 05:02:21,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449012802] [2021-08-13 05:02:21,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-08-13 05:02:21,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:02:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-13 05:02:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-13 05:02:21,417 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2021-08-13 05:02:21,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 506 transitions, 6376 flow. Second operand has 16 states, 16 states have (on average 102.4375) internal successors, (1639), 16 states have internal predecessors, (1639), 0 states have call successors, (0), 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 05:02:21,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:02:21,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2021-08-13 05:02:21,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:02:30,430 INFO L129 PetriNetUnfolder]: 24894/57862 cut-off events. [2021-08-13 05:02:30,430 INFO L130 PetriNetUnfolder]: For 63584/161888 co-relation queries the response was YES. [2021-08-13 05:02:30,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244406 conditions, 57862 events. 24894/57862 cut-off events. For 63584/161888 co-relation queries the response was YES. Maximal size of possible extension queue 7680. Compared 809146 event pairs, 32 based on Foata normal form. 462/53825 useless extension candidates. Maximal degree in co-relation 244269. Up to 19088 conditions per place. [2021-08-13 05:02:30,977 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 38 selfloop transitions, 14 changer transitions 370/635 dead transitions. [2021-08-13 05:02:30,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 635 transitions, 9868 flow [2021-08-13 05:02:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 05:02:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 05:02:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1470 transitions. [2021-08-13 05:02:30,978 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.813953488372093 [2021-08-13 05:02:30,979 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1470 transitions. [2021-08-13 05:02:30,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1470 transitions. [2021-08-13 05:02:30,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:02:30,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1470 transitions. [2021-08-13 05:02:30,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 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 05:02:30,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:02:30,985 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 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 05:02:30,986 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 131 predicate places. [2021-08-13 05:02:30,986 INFO L482 AbstractCegarLoop]: Abstraction has has 267 places, 635 transitions, 9868 flow [2021-08-13 05:02:30,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 102.4375) internal successors, (1639), 16 states have internal predecessors, (1639), 0 states have call successors, (0), 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 05:02:30,986 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:02:30,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:02:30,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-13 05:02:30,986 INFO L430 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:02:30,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:02:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2096160886, now seen corresponding path program 5 times [2021-08-13 05:02:30,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:02:30,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657733595] [2021-08-13 05:02:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:02:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:02:31,097 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:02:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:02:31,265 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:02:31,305 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 05:02:31,306 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 05:02:31,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-13 05:02:31,309 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 05:02:31,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 05:02:31 BasicIcfg [2021-08-13 05:02:31,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 05:02:31,445 INFO L168 Benchmark]: Toolchain (without parser) took 61754.50 ms. Allocated memory was 184.5 MB in the beginning and 7.7 GB in the end (delta: 7.5 GB). Free memory was 164.5 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 3.2 GB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 184.5 MB. Free memory was 165.0 MB in the beginning and 164.9 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.14 ms. Allocated memory is still 184.5 MB. Free memory was 164.5 MB in the beginning and 144.1 MB in the end (delta: 20.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 184.5 MB. Free memory was 144.1 MB in the beginning and 140.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 184.5 MB. Free memory was 140.9 MB in the beginning and 138.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: RCFGBuilder took 1890.38 ms. Allocated memory was 184.5 MB in the beginning and 222.3 MB in the end (delta: 37.7 MB). Free memory was 138.8 MB in the beginning and 175.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,445 INFO L168 Benchmark]: TraceAbstraction took 59343.36 ms. Allocated memory was 222.3 MB in the beginning and 7.7 GB in the end (delta: 7.4 GB). Free memory was 174.6 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 3.2 GB. Max. memory is 8.0 GB. [2021-08-13 05:02:31,448 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.11 ms. Allocated memory is still 184.5 MB. Free memory was 165.0 MB in the beginning and 164.9 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 406.14 ms. Allocated memory is still 184.5 MB. Free memory was 164.5 MB in the beginning and 144.1 MB in the end (delta: 20.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 184.5 MB. Free memory was 144.1 MB in the beginning and 140.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.96 ms. Allocated memory is still 184.5 MB. Free memory was 140.9 MB in the beginning and 138.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1890.38 ms. Allocated memory was 184.5 MB in the beginning and 222.3 MB in the end (delta: 37.7 MB). Free memory was 138.8 MB in the beginning and 175.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 97.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59343.36 ms. Allocated memory was 222.3 MB in the beginning and 7.7 GB in the end (delta: 7.4 GB). Free memory was 174.6 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 3.2 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t741; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t742; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t743; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 pthread_t t744; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 59056.7ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 55477.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 86.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 237 SDtfs, 853 SDslu, 882 SDs, 0 SdLazy, 1782 SolverSat, 497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1511.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2510.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15654occurred in iteration=8, InterpolantAutomatonStates: 210, 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: 72.4ms SsaConstructionTime, 677.8ms SatisfiabilityAnalysisTime, 2289.5ms InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1471 ConstructedInterpolants, 0 QuantifiedInterpolants, 8306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...